./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-crafted/xor5.i --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/array-crafted/xor5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4ee2cdc1f0cbbd62309a70b71e98ce771ffa71f4ebd85e731799a93fbbc3919 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:22:19,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:22:19,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:22:19,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:22:19,093 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:22:19,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:22:19,118 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:22:19,119 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:22:19,119 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:22:19,119 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:22:19,120 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:22:19,120 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:22:19,120 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:22:19,120 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:22:19,120 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:22:19,121 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:22:19,121 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:22:19,121 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:22:19,121 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:22:19,121 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:22:19,121 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:22:19,121 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:22:19,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:22:19,121 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:22:19,121 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:22:19,122 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:22:19,122 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:22:19,122 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:22:19,122 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:22:19,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:22:19,122 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:22:19,122 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:22:19,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:22:19,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:22:19,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:22:19,123 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:22:19,123 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:22:19,123 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:22:19,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:22:19,123 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:22:19,123 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:22:19,123 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:22:19,123 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:22:19,123 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 -> a4ee2cdc1f0cbbd62309a70b71e98ce771ffa71f4ebd85e731799a93fbbc3919 [2025-03-03 09:22:19,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:22:19,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:22:19,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:22:19,355 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:22:19,356 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:22:19,357 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/xor5.i [2025-03-03 09:22:20,536 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82111456c/3339d8af6de249c5ae5d7a97e0105242/FLAG2b75e3486 [2025-03-03 09:22:20,745 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:22:20,749 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor5.i [2025-03-03 09:22:20,775 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82111456c/3339d8af6de249c5ae5d7a97e0105242/FLAG2b75e3486 [2025-03-03 09:22:20,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82111456c/3339d8af6de249c5ae5d7a97e0105242 [2025-03-03 09:22:20,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:22:20,801 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:22:20,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:22:20,802 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:22:20,806 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:22:20,807 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:22:20" (1/1) ... [2025-03-03 09:22:20,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40b21774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:22:20, skipping insertion in model container [2025-03-03 09:22:20,808 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:22:20" (1/1) ... [2025-03-03 09:22:20,820 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:22:20,928 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/array-crafted/xor5.i[1364,1377] [2025-03-03 09:22:20,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:22:20,936 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:22:20,950 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/array-crafted/xor5.i[1364,1377] [2025-03-03 09:22:20,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:22:20,965 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:22:20,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:22:20 WrapperNode [2025-03-03 09:22:20,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:22:20,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:22:20,967 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:22:20,967 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:22:20,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:22:20" (1/1) ... [2025-03-03 09:22:20,980 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:22:20" (1/1) ... [2025-03-03 09:22:20,990 INFO L138 Inliner]: procedures = 16, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 75 [2025-03-03 09:22:20,991 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:22:20,992 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:22:20,992 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:22:20,993 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:22:20,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:22:20" (1/1) ... [2025-03-03 09:22:20,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:22:20" (1/1) ... [2025-03-03 09:22:21,001 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:22:20" (1/1) ... [2025-03-03 09:22:21,013 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 7, 11]. 55 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0]. The 5 writes are split as follows [0, 0, 5]. [2025-03-03 09:22:21,015 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:22:20" (1/1) ... [2025-03-03 09:22:21,016 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:22:20" (1/1) ... [2025-03-03 09:22:21,021 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:22:20" (1/1) ... [2025-03-03 09:22:21,025 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:22:20" (1/1) ... [2025-03-03 09:22:21,026 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:22:20" (1/1) ... [2025-03-03 09:22:21,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:22:20" (1/1) ... [2025-03-03 09:22:21,027 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:22:21,028 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:22:21,028 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:22:21,028 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:22:21,028 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:22:20" (1/1) ... [2025-03-03 09:22:21,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:22:21,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:22:21,059 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 09:22:21,063 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 09:22:21,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:22:21,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:22:21,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:22:21,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 09:22:21,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:22:21,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:22:21,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:22:21,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 09:22:21,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:22:21,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:22:21,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:22:21,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:22:21,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 09:22:21,081 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2025-03-03 09:22:21,081 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2025-03-03 09:22:21,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:22:21,142 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:22:21,143 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:22:21,283 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 09:22:21,287 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:22:21,302 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:22:21,304 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:22:21,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:22:21 BoogieIcfgContainer [2025-03-03 09:22:21,305 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:22:21,307 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:22:21,307 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:22:21,310 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:22:21,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:22:20" (1/3) ... [2025-03-03 09:22:21,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e8aa64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:22:21, skipping insertion in model container [2025-03-03 09:22:21,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:22:20" (2/3) ... [2025-03-03 09:22:21,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e8aa64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:22:21, skipping insertion in model container [2025-03-03 09:22:21,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:22:21" (3/3) ... [2025-03-03 09:22:21,313 INFO L128 eAbstractionObserver]: Analyzing ICFG xor5.i [2025-03-03 09:22:21,324 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:22:21,325 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG xor5.i that has 2 procedures, 28 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-03 09:22:21,357 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:22:21,366 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;@52e72e05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:22:21,366 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:22:21,369 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:22:21,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 09:22:21,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:22:21,373 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-03 09:22:21,373 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:22:21,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:22:21,376 INFO L85 PathProgramCache]: Analyzing trace with hash 169991808, now seen corresponding path program 1 times [2025-03-03 09:22:21,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:22:21,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825450370] [2025-03-03 09:22:21,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:22:21,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:22:21,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 09:22:21,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:22:21,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:22:21,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:22:21,658 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-03 09:22:21,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:22:21,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825450370] [2025-03-03 09:22:21,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825450370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:22:21,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:22:21,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:22:21,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589328943] [2025-03-03 09:22:21,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:22:21,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:22:21,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:22:21,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:22:21,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:22:21,677 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:22:21,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:22:21,716 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2025-03-03 09:22:21,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:22:21,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2025-03-03 09:22:21,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:22:21,722 INFO L225 Difference]: With dead ends: 53 [2025-03-03 09:22:21,722 INFO L226 Difference]: Without dead ends: 24 [2025-03-03 09:22:21,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:22:21,728 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:22:21,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:22:21,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-03 09:22:21,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-03 09:22:21,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:22:21,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2025-03-03 09:22:21,749 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 25 [2025-03-03 09:22:21,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:22:21,750 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-03-03 09:22:21,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:22:21,750 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2025-03-03 09:22:21,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 09:22:21,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:22:21,751 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] [2025-03-03 09:22:21,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:22:21,751 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:22:21,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:22:21,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1576506963, now seen corresponding path program 1 times [2025-03-03 09:22:21,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:22:21,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990624900] [2025-03-03 09:22:21,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:22:21,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:22:21,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 09:22:21,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 09:22:21,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:22:21,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:22:21,872 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 09:22:21,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:22:21,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990624900] [2025-03-03 09:22:21,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990624900] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:22:21,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585056896] [2025-03-03 09:22:21,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:22:21,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:22:21,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:22:21,875 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 09:22:21,877 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 09:22:21,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 09:22:21,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 09:22:21,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:22:21,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:22:21,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:22:21,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:22:22,004 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:22:22,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:22:22,049 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:22:22,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585056896] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:22:22,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:22:22,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-03-03 09:22:22,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515033382] [2025-03-03 09:22:22,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:22:22,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 09:22:22,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:22:22,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 09:22:22,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 09:22:22,054 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 09:22:22,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:22:22,124 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2025-03-03 09:22:22,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:22:22,124 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 26 [2025-03-03 09:22:22,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:22:22,125 INFO L225 Difference]: With dead ends: 50 [2025-03-03 09:22:22,125 INFO L226 Difference]: Without dead ends: 31 [2025-03-03 09:22:22,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:22:22,126 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 42 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:22:22,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 82 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:22:22,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-03 09:22:22,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2025-03-03 09:22:22,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:22:22,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2025-03-03 09:22:22,133 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 26 [2025-03-03 09:22:22,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:22:22,133 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2025-03-03 09:22:22,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 09:22:22,133 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2025-03-03 09:22:22,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 09:22:22,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:22:22,136 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:22:22,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 09:22:22,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:22:22,340 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:22:22,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:22:22,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1147890558, now seen corresponding path program 1 times [2025-03-03 09:22:22,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:22:22,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752214614] [2025-03-03 09:22:22,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:22:22,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:22:22,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 09:22:22,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 09:22:22,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:22:22,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:22:22,447 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-03 09:22:22,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:22:22,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752214614] [2025-03-03 09:22:22,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752214614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:22:22,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:22:22,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:22:22,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070776081] [2025-03-03 09:22:22,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:22:22,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:22:22,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:22:22,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:22:22,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:22:22,449 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:22:22,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:22:22,487 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2025-03-03 09:22:22,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:22:22,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2025-03-03 09:22:22,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:22:22,488 INFO L225 Difference]: With dead ends: 42 [2025-03-03 09:22:22,488 INFO L226 Difference]: Without dead ends: 27 [2025-03-03 09:22:22,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:22:22,488 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 22 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:22:22,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 36 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:22:22,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-03 09:22:22,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-03 09:22:22,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:22:22,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2025-03-03 09:22:22,492 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 36 [2025-03-03 09:22:22,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:22:22,493 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2025-03-03 09:22:22,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:22:22,493 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2025-03-03 09:22:22,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 09:22:22,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:22:22,493 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:22:22,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:22:22,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:22:22,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:22:22,494 INFO L85 PathProgramCache]: Analyzing trace with hash 636144981, now seen corresponding path program 1 times [2025-03-03 09:22:22,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:22:22,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252283608] [2025-03-03 09:22:22,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:22:22,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:22:22,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 09:22:22,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 09:22:22,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:22:22,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:22:24,574 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 09:22:24,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:22:24,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252283608] [2025-03-03 09:22:24,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252283608] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:22:24,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380908483] [2025-03-03 09:22:24,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:22:24,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:22:24,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:22:24,579 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 09:22:24,580 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 09:22:24,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 09:22:24,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 09:22:24,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:22:24,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:22:24,670 WARN L254 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 102 conjuncts are in the unsatisfiable core [2025-03-03 09:22:24,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:22:24,753 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 15 treesize of output 1 [2025-03-03 09:22:25,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 33 [2025-03-03 09:22:25,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:22:25,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 43 [2025-03-03 09:22:25,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:22:25,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 43 [2025-03-03 09:22:26,347 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:22:26,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:22:28,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380908483] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:22:28,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:22:28,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 31] total 53 [2025-03-03 09:22:28,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262797514] [2025-03-03 09:22:28,232 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:22:28,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-03 09:22:28,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:22:28,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-03 09:22:28,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=4517, Unknown=0, NotChecked=0, Total=4830 [2025-03-03 09:22:28,234 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 53 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 45 states have internal predecessors, (55), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-03 09:22:30,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:22:30,129 INFO L93 Difference]: Finished difference Result 138 states and 199 transitions. [2025-03-03 09:22:30,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-03 09:22:30,129 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 45 states have internal predecessors, (55), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 37 [2025-03-03 09:22:30,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:22:30,131 INFO L225 Difference]: With dead ends: 138 [2025-03-03 09:22:30,131 INFO L226 Difference]: Without dead ends: 134 [2025-03-03 09:22:30,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2559 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=693, Invalid=8619, Unknown=0, NotChecked=0, Total=9312 [2025-03-03 09:22:30,134 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 191 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 1908 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 1951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 09:22:30,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 293 Invalid, 1951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1908 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 09:22:30,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-03 09:22:30,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 75. [2025-03-03 09:22:30,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 64 states have internal predecessors, (86), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-03 09:22:30,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 106 transitions. [2025-03-03 09:22:30,144 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 106 transitions. Word has length 37 [2025-03-03 09:22:30,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:22:30,145 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 106 transitions. [2025-03-03 09:22:30,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 45 states have internal predecessors, (55), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-03 09:22:30,145 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 106 transitions. [2025-03-03 09:22:30,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 09:22:30,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:22:30,146 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:22:30,152 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 09:22:30,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-03 09:22:30,346 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:22:30,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:22:30,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1234238558, now seen corresponding path program 1 times [2025-03-03 09:22:30,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:22:30,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392192894] [2025-03-03 09:22:30,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:22:30,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:22:30,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 09:22:30,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 09:22:30,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:22:30,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:22:30,713 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:22:30,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:22:30,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392192894] [2025-03-03 09:22:30,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392192894] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:22:30,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807838655] [2025-03-03 09:22:30,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:22:30,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:22:30,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:22:30,719 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 09:22:30,720 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 09:22:30,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 09:22:30,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 09:22:30,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:22:30,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:22:30,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-03 09:22:30,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:22:30,797 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 8 treesize of output 1 [2025-03-03 09:22:30,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2025-03-03 09:22:30,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2025-03-03 09:22:30,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:22:30,964 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-03-03 09:22:30,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 26 [2025-03-03 09:22:31,033 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:22:31,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:22:43,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807838655] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:22:43,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:22:43,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 23 [2025-03-03 09:22:43,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982625145] [2025-03-03 09:22:43,179 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:22:43,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 09:22:43,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:22:43,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 09:22:43,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=640, Unknown=3, NotChecked=0, Total=756 [2025-03-03 09:22:43,181 INFO L87 Difference]: Start difference. First operand 75 states and 106 transitions. Second operand has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 20 states have internal predecessors, (54), 3 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 09:22:47,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 09:22:51,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 09:22:55,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 09:22:59,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 09:23:03,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 09:23:07,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 09:23:11,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 09:23:15,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 09:23:19,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 09:23:23,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 09:23:29,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 09:23:33,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 09:23:37,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 09:23:41,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 09:23:45,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 09:23:49,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 09:23:49,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:23:49,186 INFO L93 Difference]: Finished difference Result 239 states and 346 transitions. [2025-03-03 09:23:49,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 09:23:49,186 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 20 states have internal predecessors, (54), 3 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 38 [2025-03-03 09:23:49,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:23:49,188 INFO L225 Difference]: With dead ends: 239 [2025-03-03 09:23:49,188 INFO L226 Difference]: Without dead ends: 213 [2025-03-03 09:23:49,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=223, Invalid=1256, Unknown=3, NotChecked=0, Total=1482 [2025-03-03 09:23:49,189 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 110 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 20 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 65.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 65.8s IncrementalHoareTripleChecker+Time [2025-03-03 09:23:49,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 383 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 720 Invalid, 19 Unknown, 0 Unchecked, 65.8s Time] [2025-03-03 09:23:49,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-03 09:23:49,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 136. [2025-03-03 09:23:49,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 114 states have (on average 1.4385964912280702) internal successors, (164), 118 states have internal predecessors, (164), 11 states have call successors, (11), 6 states have call predecessors, (11), 10 states have return successors, (21), 11 states have call predecessors, (21), 11 states have call successors, (21) [2025-03-03 09:23:49,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 196 transitions. [2025-03-03 09:23:49,205 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 196 transitions. Word has length 38 [2025-03-03 09:23:49,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:23:49,205 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 196 transitions. [2025-03-03 09:23:49,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 20 states have internal predecessors, (54), 3 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 09:23:49,205 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 196 transitions. [2025-03-03 09:23:49,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 09:23:49,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:23:49,207 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:23:49,213 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 09:23:49,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:49,410 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:23:49,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:23:49,410 INFO L85 PathProgramCache]: Analyzing trace with hash -915189746, now seen corresponding path program 2 times [2025-03-03 09:23:49,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:23:49,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422963773] [2025-03-03 09:23:49,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:23:49,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:23:49,416 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-03 09:23:49,470 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 09:23:49,473 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:23:49,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:52,093 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:23:52,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:23:52,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422963773] [2025-03-03 09:23:52,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422963773] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:23:52,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636526696] [2025-03-03 09:23:52,094 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:23:52,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:52,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:23:52,096 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 09:23:52,098 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 09:23:52,144 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-03 09:23:52,166 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 09:23:52,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:23:52,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:52,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-03-03 09:23:52,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:23:52,227 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 15 treesize of output 1 [2025-03-03 09:23:52,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 33 [2025-03-03 09:23:52,964 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 90 treesize of output 54 [2025-03-03 09:23:53,099 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 15 treesize of output 1 [2025-03-03 09:23:53,400 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 124 treesize of output 76 [2025-03-03 09:23:53,507 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:23:53,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:23:53,936 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 63 treesize of output 57 [2025-03-03 09:23:53,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 81 treesize of output 69 [2025-03-03 09:23:53,952 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 59 treesize of output 53 [2025-03-03 09:23:53,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 73 treesize of output 61 [2025-03-03 09:23:54,952 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:23:54,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636526696] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:23:54,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:23:54,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 26] total 74 [2025-03-03 09:23:54,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942802285] [2025-03-03 09:23:54,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:23:54,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2025-03-03 09:23:54,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:23:54,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2025-03-03 09:23:54,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=5119, Unknown=0, NotChecked=0, Total=5402 [2025-03-03 09:23:54,955 INFO L87 Difference]: Start difference. First operand 136 states and 196 transitions. Second operand has 74 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 65 states have internal predecessors, (89), 9 states have call successors, (9), 2 states have call predecessors, (9), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 09:23:58,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:23:58,124 INFO L93 Difference]: Finished difference Result 378 states and 577 transitions. [2025-03-03 09:23:58,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-03 09:23:58,124 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 65 states have internal predecessors, (89), 9 states have call successors, (9), 2 states have call predecessors, (9), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 38 [2025-03-03 09:23:58,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:23:58,127 INFO L225 Difference]: With dead ends: 378 [2025-03-03 09:23:58,127 INFO L226 Difference]: Without dead ends: 372 [2025-03-03 09:23:58,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2319 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=623, Invalid=10297, Unknown=0, NotChecked=0, Total=10920 [2025-03-03 09:23:58,129 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 207 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 2118 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 2166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 2118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:23:58,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 350 Invalid, 2166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 2118 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 09:23:58,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-03 09:23:58,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 146. [2025-03-03 09:23:58,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 122 states have (on average 1.4426229508196722) internal successors, (176), 127 states have internal predecessors, (176), 12 states have call successors, (12), 6 states have call predecessors, (12), 11 states have return successors, (25), 12 states have call predecessors, (25), 12 states have call successors, (25) [2025-03-03 09:23:58,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2025-03-03 09:23:58,156 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 38 [2025-03-03 09:23:58,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:23:58,156 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2025-03-03 09:23:58,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 65 states have internal predecessors, (89), 9 states have call successors, (9), 2 states have call predecessors, (9), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 09:23:58,156 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2025-03-03 09:23:58,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 09:23:58,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:23:58,159 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:23:58,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 09:23:58,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:58,359 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:23:58,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:23:58,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1787995324, now seen corresponding path program 3 times [2025-03-03 09:23:58,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:23:58,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137240947] [2025-03-03 09:23:58,360 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:23:58,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:23:58,365 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 5 equivalence classes. [2025-03-03 09:23:58,374 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 09:23:58,375 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-03 09:23:58,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:58,918 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:23:58,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:23:58,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137240947] [2025-03-03 09:23:58,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137240947] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:23:58,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520830732] [2025-03-03 09:23:58,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:23:58,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:23:58,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:23:58,920 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 09:23:58,922 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 09:23:58,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 5 equivalence classes. [2025-03-03 09:23:58,985 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 09:23:58,985 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-03 09:23:58,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:23:58,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-03 09:23:58,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:23:59,011 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 8 treesize of output 1 [2025-03-03 09:23:59,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2025-03-03 09:23:59,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:23:59,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:23:59,226 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-03-03 09:23:59,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 25 [2025-03-03 09:23:59,318 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:23:59,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:23:59,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520830732] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:23:59,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:23:59,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 32 [2025-03-03 09:23:59,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743042484] [2025-03-03 09:23:59,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:23:59,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 09:23:59,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:23:59,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 09:23:59,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1250, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 09:23:59,488 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand has 32 states, 29 states have (on average 2.0) internal successors, (58), 28 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6)