./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/standard_partition_ground-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-examples/standard_partition_ground-2.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 fcf72d109deb69f1acda4466c7376bd6c362d474983f8a50a2faed8c0a192a76 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:15:50,963 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:15:51,009 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:15:51,013 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:15:51,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:15:51,030 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:15:51,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:15:51,032 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:15:51,032 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:15:51,032 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:15:51,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:15:51,033 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:15:51,033 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:15:51,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:15:51,034 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:15:51,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:15:51,034 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:15:51,034 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:15:51,034 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:15:51,034 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:15:51,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:15:51,034 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:15:51,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:15:51,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:15:51,035 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:15:51,035 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:15:51,035 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:15:51,035 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:15:51,035 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:15:51,035 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:15:51,035 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:15:51,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:15:51,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:15:51,036 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:15:51,036 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:15:51,036 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:15:51,036 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:15:51,036 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:15:51,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:15:51,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:15:51,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:15:51,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:15:51,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:15:51,036 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 -> fcf72d109deb69f1acda4466c7376bd6c362d474983f8a50a2faed8c0a192a76 [2025-03-08 00:15:51,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:15:51,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:15:51,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:15:51,259 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:15:51,259 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:15:51,260 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_partition_ground-2.i [2025-03-08 00:15:52,327 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a40abb4f/21f6de0121264a4686447f711a91953d/FLAGc08f960e1 [2025-03-08 00:15:52,537 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:15:52,537 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_partition_ground-2.i [2025-03-08 00:15:52,542 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a40abb4f/21f6de0121264a4686447f711a91953d/FLAGc08f960e1 [2025-03-08 00:15:52,883 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a40abb4f/21f6de0121264a4686447f711a91953d [2025-03-08 00:15:52,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:15:52,887 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:15:52,888 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:15:52,888 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:15:52,892 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:15:52,893 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:15:52" (1/1) ... [2025-03-08 00:15:52,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6591b8f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:15:52, skipping insertion in model container [2025-03-08 00:15:52,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:15:52" (1/1) ... [2025-03-08 00:15:52,905 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:15:52,991 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-examples/standard_partition_ground-2.i[820,833] [2025-03-08 00:15:53,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:15:53,007 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:15:53,014 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-examples/standard_partition_ground-2.i[820,833] [2025-03-08 00:15:53,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:15:53,027 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:15:53,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:15:53 WrapperNode [2025-03-08 00:15:53,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:15:53,028 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:15:53,028 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:15:53,028 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:15:53,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:15:53" (1/1) ... [2025-03-08 00:15:53,037 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:15:53" (1/1) ... [2025-03-08 00:15:53,047 INFO L138 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2025-03-08 00:15:53,048 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:15:53,048 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:15:53,048 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:15:53,049 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:15:53,053 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:15:53" (1/1) ... [2025-03-08 00:15:53,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:15:53" (1/1) ... [2025-03-08 00:15:53,059 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:15:53" (1/1) ... [2025-03-08 00:15:53,070 INFO L175 MemorySlicer]: Split 9 memory accesses to 3 slices as follows [2, 5, 2]. 56 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-03-08 00:15:53,071 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:15:53" (1/1) ... [2025-03-08 00:15:53,071 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:15:53" (1/1) ... [2025-03-08 00:15:53,076 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:15:53" (1/1) ... [2025-03-08 00:15:53,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:15:53" (1/1) ... [2025-03-08 00:15:53,078 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:15:53" (1/1) ... [2025-03-08 00:15:53,078 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:15:53" (1/1) ... [2025-03-08 00:15:53,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:15:53,080 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:15:53,080 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:15:53,080 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:15:53,082 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:15:53" (1/1) ... [2025-03-08 00:15:53,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:15:53,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:15:53,105 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-08 00:15:53,108 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-08 00:15:53,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:15:53,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:15:53,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:15:53,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:15:53,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:15:53,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:15:53,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:15:53,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:15:53,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:15:53,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:15:53,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:15:53,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:15:53,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:15:53,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:15:53,184 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:15:53,185 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:15:53,316 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: call ULTIMATE.dealloc(main_~#aa~0#1.base, main_~#aa~0#1.offset);havoc main_~#aa~0#1.base, main_~#aa~0#1.offset;call ULTIMATE.dealloc(main_~#bb~0#1.base, main_~#bb~0#1.offset);havoc main_~#bb~0#1.base, main_~#bb~0#1.offset; [2025-03-08 00:15:53,324 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-08 00:15:53,324 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:15:53,333 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:15:53,333 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:15:53,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:15:53 BoogieIcfgContainer [2025-03-08 00:15:53,334 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:15:53,335 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:15:53,336 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:15:53,339 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:15:53,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:15:52" (1/3) ... [2025-03-08 00:15:53,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@644774b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:15:53, skipping insertion in model container [2025-03-08 00:15:53,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:15:53" (2/3) ... [2025-03-08 00:15:53,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@644774b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:15:53, skipping insertion in model container [2025-03-08 00:15:53,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:15:53" (3/3) ... [2025-03-08 00:15:53,342 INFO L128 eAbstractionObserver]: Analyzing ICFG standard_partition_ground-2.i [2025-03-08 00:15:53,353 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:15:53,354 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG standard_partition_ground-2.i that has 1 procedures, 17 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-08 00:15:53,388 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:15:53,397 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;@3f535326, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:15:53,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:15:53,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:15:53,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 00:15:53,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:15:53,405 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:15:53,405 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:15:53,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:15:53,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1740535303, now seen corresponding path program 1 times [2025-03-08 00:15:53,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:15:53,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115135248] [2025-03-08 00:15:53,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:15:53,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:15:53,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 00:15:53,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 00:15:53,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:15:53,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:15:53,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:15:53,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:15:53,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115135248] [2025-03-08 00:15:53,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115135248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:15:53,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:15:53,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:15:53,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849132703] [2025-03-08 00:15:53,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:15:53,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:15:53,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:15:53,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:15:53,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:15:53,570 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:15:53,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:15:53,583 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2025-03-08 00:15:53,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:15:53,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 00:15:53,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:15:53,589 INFO L225 Difference]: With dead ends: 32 [2025-03-08 00:15:53,589 INFO L226 Difference]: Without dead ends: 15 [2025-03-08 00:15:53,590 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-08 00:15:53,592 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:15:53,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:15:53,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-08 00:15:53,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-08 00:15:53,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:15:53,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2025-03-08 00:15:53,610 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 8 [2025-03-08 00:15:53,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:15:53,610 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 20 transitions. [2025-03-08 00:15:53,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:15:53,611 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2025-03-08 00:15:53,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 00:15:53,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:15:53,611 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:15:53,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:15:53,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:15:53,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:15:53,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1381688050, now seen corresponding path program 1 times [2025-03-08 00:15:53,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:15:53,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912683698] [2025-03-08 00:15:53,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:15:53,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:15:53,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 00:15:53,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 00:15:53,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:15:53,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:15:53,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:15:53,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:15:53,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912683698] [2025-03-08 00:15:53,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912683698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:15:53,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:15:53,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:15:53,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173053175] [2025-03-08 00:15:53,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:15:53,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:15:53,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:15:53,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:15:53,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:15:53,689 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:15:53,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:15:53,721 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2025-03-08 00:15:53,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:15:53,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 00:15:53,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:15:53,722 INFO L225 Difference]: With dead ends: 29 [2025-03-08 00:15:53,722 INFO L226 Difference]: Without dead ends: 21 [2025-03-08 00:15:53,723 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-08 00:15:53,723 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:15:53,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:15:53,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-08 00:15:53,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2025-03-08 00:15:53,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:15:53,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2025-03-08 00:15:53,727 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 9 [2025-03-08 00:15:53,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:15:53,728 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2025-03-08 00:15:53,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:15:53,728 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2025-03-08 00:15:53,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 00:15:53,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:15:53,729 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:15:53,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:15:53,729 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:15:53,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:15:53,730 INFO L85 PathProgramCache]: Analyzing trace with hash 570138575, now seen corresponding path program 1 times [2025-03-08 00:15:53,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:15:53,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821599386] [2025-03-08 00:15:53,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:15:53,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:15:53,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 00:15:53,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 00:15:53,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:15:53,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:15:53,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:15:53,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:15:53,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821599386] [2025-03-08 00:15:53,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821599386] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:15:53,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082077278] [2025-03-08 00:15:53,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:15:53,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:15:53,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:15:53,803 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-08 00:15:53,804 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-08 00:15:53,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 00:15:53,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 00:15:53,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:15:53,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:15:53,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:15:53,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:15:53,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:15:53,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:15:53,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:15:53,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082077278] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:15:53,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:15:53,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 00:15:53,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237489991] [2025-03-08 00:15:53,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:15:53,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 00:15:53,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:15:53,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 00:15:53,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:15:53,913 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:15:53,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:15:53,925 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2025-03-08 00:15:53,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:15:53,926 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-08 00:15:53,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:15:53,926 INFO L225 Difference]: With dead ends: 33 [2025-03-08 00:15:53,926 INFO L226 Difference]: Without dead ends: 20 [2025-03-08 00:15:53,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:15:53,927 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:15:53,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:15:53,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-08 00:15:53,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-08 00:15:53,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:15:53,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-03-08 00:15:53,932 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 15 [2025-03-08 00:15:53,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:15:53,933 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-03-08 00:15:53,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:15:53,933 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2025-03-08 00:15:53,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 00:15:53,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:15:53,934 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:15:53,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 00:15:54,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:15:54,138 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:15:54,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:15:54,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1859445318, now seen corresponding path program 2 times [2025-03-08 00:15:54,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:15:54,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633198448] [2025-03-08 00:15:54,139 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:15:54,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:15:54,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-08 00:15:54,172 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 00:15:54,175 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:15:54,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:15:54,237 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 00:15:54,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:15:54,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633198448] [2025-03-08 00:15:54,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633198448] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:15:54,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307622852] [2025-03-08 00:15:54,238 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:15:54,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:15:54,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:15:54,240 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-08 00:15:54,240 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-08 00:15:54,280 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-08 00:15:54,298 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 00:15:54,298 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:15:54,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:15:54,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:15:54,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:15:54,343 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:15:54,343 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:15:54,430 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:15:54,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307622852] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:15:54,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:15:54,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-03-08 00:15:54,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080060361] [2025-03-08 00:15:54,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:15:54,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:15:54,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:15:54,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:15:54,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:15:54,431 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:15:54,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:15:54,572 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2025-03-08 00:15:54,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 00:15:54,573 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-08 00:15:54,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:15:54,573 INFO L225 Difference]: With dead ends: 49 [2025-03-08 00:15:54,573 INFO L226 Difference]: Without dead ends: 36 [2025-03-08 00:15:54,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2025-03-08 00:15:54,574 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:15:54,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 72 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:15:54,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-08 00:15:54,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2025-03-08 00:15:54,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:15:54,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-03-08 00:15:54,580 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 18 [2025-03-08 00:15:54,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:15:54,580 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-03-08 00:15:54,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:15:54,580 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-03-08 00:15:54,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 00:15:54,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:15:54,581 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:15:54,590 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-08 00:15:54,789 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-08 00:15:54,789 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:15:54,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:15:54,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1451256825, now seen corresponding path program 3 times [2025-03-08 00:15:54,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:15:54,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357664865] [2025-03-08 00:15:54,790 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:15:54,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:15:54,807 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 6 equivalence classes. [2025-03-08 00:15:54,820 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 24 of 30 statements. [2025-03-08 00:15:54,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:15:54,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:15:54,878 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 00:15:54,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:15:54,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357664865] [2025-03-08 00:15:54,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357664865] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:15:54,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900252069] [2025-03-08 00:15:54,879 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:15:54,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:15:54,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:15:54,881 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-08 00:15:54,882 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-08 00:15:54,921 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 6 equivalence classes. [2025-03-08 00:15:54,943 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 24 of 30 statements. [2025-03-08 00:15:54,943 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:15:54,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:15:54,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:15:54,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:15:54,967 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 00:15:54,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:15:54,998 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 00:15:54,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900252069] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:15:54,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:15:54,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-08 00:15:54,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205975837] [2025-03-08 00:15:54,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:15:54,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 00:15:54,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:15:54,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 00:15:54,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:15:54,999 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:15:55,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:15:55,070 INFO L93 Difference]: Finished difference Result 68 states and 94 transitions. [2025-03-08 00:15:55,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:15:55,071 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-08 00:15:55,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:15:55,071 INFO L225 Difference]: With dead ends: 68 [2025-03-08 00:15:55,071 INFO L226 Difference]: Without dead ends: 56 [2025-03-08 00:15:55,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:15:55,072 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 62 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:15:55,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 37 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:15:55,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-08 00:15:55,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-08 00:15:55,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.290909090909091) internal successors, (71), 55 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:15:55,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2025-03-08 00:15:55,079 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 30 [2025-03-08 00:15:55,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:15:55,079 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2025-03-08 00:15:55,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:15:55,079 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2025-03-08 00:15:55,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 00:15:55,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:15:55,080 INFO L218 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:15:55,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 00:15:55,280 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-08 00:15:55,280 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:15:55,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:15:55,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1459936697, now seen corresponding path program 4 times [2025-03-08 00:15:55,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:15:55,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265497482] [2025-03-08 00:15:55,281 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:15:55,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:15:55,302 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-03-08 00:15:55,323 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 00:15:55,323 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:15:55,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:15:55,481 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-08 00:15:55,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:15:55,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265497482] [2025-03-08 00:15:55,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265497482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:15:55,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883315793] [2025-03-08 00:15:55,482 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:15:55,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:15:55,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:15:55,484 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-08 00:15:55,486 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-08 00:15:55,543 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-03-08 00:15:55,578 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 00:15:55,579 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:15:55,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:15:55,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:15:55,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:15:55,621 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-08 00:15:55,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:15:55,719 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-08 00:15:55,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883315793] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:15:55,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:15:55,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-08 00:15:55,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060228288] [2025-03-08 00:15:55,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:15:55,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 00:15:55,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:15:55,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 00:15:55,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:15:55,721 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:15:55,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:15:55,832 INFO L93 Difference]: Finished difference Result 128 states and 182 transitions. [2025-03-08 00:15:55,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 00:15:55,834 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-08 00:15:55,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:15:55,834 INFO L225 Difference]: With dead ends: 128 [2025-03-08 00:15:55,834 INFO L226 Difference]: Without dead ends: 104 [2025-03-08 00:15:55,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:15:55,835 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 156 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:15:55,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 57 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:15:55,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-08 00:15:55,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-08 00:15:55,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:15:55,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2025-03-08 00:15:55,849 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 135 transitions. Word has length 54 [2025-03-08 00:15:55,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:15:55,849 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 135 transitions. [2025-03-08 00:15:55,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:15:55,850 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 135 transitions. [2025-03-08 00:15:55,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 00:15:55,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:15:55,851 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:15:55,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 00:15:56,057 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-08 00:15:56,057 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:15:56,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:15:56,058 INFO L85 PathProgramCache]: Analyzing trace with hash -895262407, now seen corresponding path program 5 times [2025-03-08 00:15:56,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:15:56,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295573971] [2025-03-08 00:15:56,058 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:15:56,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:15:56,079 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 102 statements into 15 equivalence classes. [2025-03-08 00:15:56,165 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 00:15:56,165 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-03-08 00:15:56,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:15:56,530 INFO L134 CoverageAnalysis]: Checked inductivity of 629 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2025-03-08 00:15:56,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:15:56,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295573971] [2025-03-08 00:15:56,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295573971] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:15:56,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298814911] [2025-03-08 00:15:56,530 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:15:56,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:15:56,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:15:56,534 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-08 00:15:56,536 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-08 00:15:56,600 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 102 statements into 15 equivalence classes. [2025-03-08 00:16:05,034 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 00:16:05,034 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-03-08 00:16:05,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:16:05,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 00:16:05,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:16:05,113 INFO L134 CoverageAnalysis]: Checked inductivity of 629 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2025-03-08 00:16:05,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:16:05,430 INFO L134 CoverageAnalysis]: Checked inductivity of 629 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2025-03-08 00:16:05,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298814911] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:16:05,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:16:05,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2025-03-08 00:16:05,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891742167] [2025-03-08 00:16:05,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:16:05,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 00:16:05,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:16:05,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 00:16:05,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2025-03-08 00:16:05,433 INFO L87 Difference]: Start difference. First operand 104 states and 135 transitions. Second operand has 32 states, 32 states have (on average 3.0625) internal successors, (98), 32 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:16:05,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:16:05,714 INFO L93 Difference]: Finished difference Result 248 states and 358 transitions. [2025-03-08 00:16:05,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 00:16:05,715 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.0625) internal successors, (98), 32 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2025-03-08 00:16:05,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:16:05,716 INFO L225 Difference]: With dead ends: 248 [2025-03-08 00:16:05,716 INFO L226 Difference]: Without dead ends: 200 [2025-03-08 00:16:05,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2025-03-08 00:16:05,717 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 418 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:16:05,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 89 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:16:05,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-08 00:16:05,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-03-08 00:16:05,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 1.321608040201005) internal successors, (263), 199 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:16:05,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 263 transitions. [2025-03-08 00:16:05,735 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 263 transitions. Word has length 102 [2025-03-08 00:16:05,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:16:05,736 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 263 transitions. [2025-03-08 00:16:05,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.0625) internal successors, (98), 32 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:16:05,736 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 263 transitions. [2025-03-08 00:16:05,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-08 00:16:05,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:16:05,740 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:16:05,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 00:16:05,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:16:05,941 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:16:05,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:16:05,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1467410489, now seen corresponding path program 6 times [2025-03-08 00:16:05,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:16:05,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582187135] [2025-03-08 00:16:05,942 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:16:05,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:16:05,966 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 198 statements into 31 equivalence classes. [2025-03-08 00:16:05,980 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 36 of 198 statements. [2025-03-08 00:16:05,980 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-08 00:16:05,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:16:06,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2725 backedges. 59 proven. 59 refuted. 0 times theorem prover too weak. 2607 trivial. 0 not checked. [2025-03-08 00:16:06,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:16:06,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582187135] [2025-03-08 00:16:06,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582187135] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:16:06,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912483375] [2025-03-08 00:16:06,198 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:16:06,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:16:06,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:16:06,200 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:16:06,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 00:16:06,288 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 198 statements into 31 equivalence classes. [2025-03-08 00:16:06,311 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 36 of 198 statements. [2025-03-08 00:16:06,312 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-08 00:16:06,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:16:06,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 00:16:06,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:16:06,608 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 15 treesize of output 7 [2025-03-08 00:16:06,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2725 backedges. 59 proven. 59 refuted. 0 times theorem prover too weak. 2607 trivial. 0 not checked. [2025-03-08 00:16:06,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:16:06,763 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 00:16:06,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 12 [2025-03-08 00:16:06,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2725 backedges. 88 proven. 30 refuted. 0 times theorem prover too weak. 2607 trivial. 0 not checked. [2025-03-08 00:16:06,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912483375] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:16:06,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:16:06,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-08 00:16:06,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871160064] [2025-03-08 00:16:06,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:16:06,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 00:16:06,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:16:06,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 00:16:06,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:16:06,787 INFO L87 Difference]: Start difference. First operand 200 states and 263 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:16:06,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:16:06,870 INFO L93 Difference]: Finished difference Result 479 states and 633 transitions. [2025-03-08 00:16:06,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:16:06,870 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2025-03-08 00:16:06,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:16:06,872 INFO L225 Difference]: With dead ends: 479 [2025-03-08 00:16:06,872 INFO L226 Difference]: Without dead ends: 385 [2025-03-08 00:16:06,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:16:06,873 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:16:06,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 82 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:16:06,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-08 00:16:06,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 291. [2025-03-08 00:16:06,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.3241379310344827) internal successors, (384), 290 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:16:06,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 384 transitions. [2025-03-08 00:16:06,889 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 384 transitions. Word has length 198 [2025-03-08 00:16:06,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:16:06,890 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 384 transitions. [2025-03-08 00:16:06,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:16:06,890 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 384 transitions. [2025-03-08 00:16:06,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-08 00:16:06,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:16:06,894 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 30, 30, 29, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:16:06,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 00:16:07,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:16:07,095 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:16:07,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:16:07,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1025655994, now seen corresponding path program 1 times [2025-03-08 00:16:07,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:16:07,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851086083] [2025-03-08 00:16:07,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:16:07,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:16:07,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 00:16:07,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 00:16:07,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:16:07,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:16:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2725 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2670 trivial. 0 not checked. [2025-03-08 00:16:07,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:16:07,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851086083] [2025-03-08 00:16:07,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851086083] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:16:07,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467865794] [2025-03-08 00:16:07,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:16:07,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:16:07,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:16:07,487 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:16:07,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 00:16:07,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 00:16:07,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 00:16:07,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:16:07,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:16:07,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:16:07,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:16:07,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2725 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2670 trivial. 0 not checked. [2025-03-08 00:16:07,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:16:07,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2725 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2670 trivial. 0 not checked. [2025-03-08 00:16:07,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467865794] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:16:07,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:16:07,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-08 00:16:07,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114449259] [2025-03-08 00:16:07,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:16:07,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 00:16:07,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:16:07,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 00:16:07,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:16:07,836 INFO L87 Difference]: Start difference. First operand 291 states and 384 transitions. Second operand has 25 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:16:07,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:16:07,860 INFO L93 Difference]: Finished difference Result 581 states and 778 transitions. [2025-03-08 00:16:07,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 00:16:07,861 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2025-03-08 00:16:07,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:16:07,862 INFO L225 Difference]: With dead ends: 581 [2025-03-08 00:16:07,862 INFO L226 Difference]: Without dead ends: 303 [2025-03-08 00:16:07,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:16:07,863 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:16:07,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:16:07,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-03-08 00:16:07,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2025-03-08 00:16:07,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 1.3112582781456954) internal successors, (396), 302 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:16:07,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 396 transitions. [2025-03-08 00:16:07,882 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 396 transitions. Word has length 198 [2025-03-08 00:16:07,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:16:07,882 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 396 transitions. [2025-03-08 00:16:07,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:16:07,882 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 396 transitions. [2025-03-08 00:16:07,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-08 00:16:07,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:16:07,884 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 30, 30, 29, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:16:07,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 00:16:08,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:16:08,085 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:16:08,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:16:08,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1190843270, now seen corresponding path program 2 times [2025-03-08 00:16:08,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:16:08,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733812555] [2025-03-08 00:16:08,086 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:16:08,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:16:08,112 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 210 statements into 2 equivalence classes. [2025-03-08 00:16:08,136 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 00:16:08,136 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:16:08,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:16:08,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2923 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2670 trivial. 0 not checked. [2025-03-08 00:16:08,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:16:08,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733812555] [2025-03-08 00:16:08,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733812555] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:16:08,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943296562] [2025-03-08 00:16:08,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:16:08,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:16:08,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:16:08,864 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:16:08,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 00:16:08,974 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 210 statements into 2 equivalence classes. [2025-03-08 00:16:09,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 00:16:09,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:16:09,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:16:09,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 00:16:09,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:16:09,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2923 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2670 trivial. 0 not checked. [2025-03-08 00:16:09,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:16:09,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2923 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2670 trivial. 0 not checked. [2025-03-08 00:16:09,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943296562] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:16:09,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:16:09,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2025-03-08 00:16:09,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893393983] [2025-03-08 00:16:09,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:16:09,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-08 00:16:09,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:16:09,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-08 00:16:09,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 00:16:09,646 INFO L87 Difference]: Start difference. First operand 303 states and 396 transitions. Second operand has 49 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 49 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:16:09,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:16:09,687 INFO L93 Difference]: Finished difference Result 605 states and 814 transitions. [2025-03-08 00:16:09,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-08 00:16:09,688 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 49 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210 [2025-03-08 00:16:09,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:16:09,689 INFO L225 Difference]: With dead ends: 605 [2025-03-08 00:16:09,689 INFO L226 Difference]: Without dead ends: 327 [2025-03-08 00:16:09,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 00:16:09,694 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:16:09,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:16:09,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-03-08 00:16:09,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2025-03-08 00:16:09,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 1.2883435582822085) internal successors, (420), 326 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:16:09,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 420 transitions. [2025-03-08 00:16:09,707 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 420 transitions. Word has length 210 [2025-03-08 00:16:09,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:16:09,708 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 420 transitions. [2025-03-08 00:16:09,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 49 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:16:09,708 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 420 transitions. [2025-03-08 00:16:09,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-08 00:16:09,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:16:09,710 INFO L218 NwaCegarLoop]: trace histogram [46, 30, 30, 30, 30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:16:09,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 00:16:09,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 00:16:09,914 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:16:09,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:16:09,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1096672262, now seen corresponding path program 3 times [2025-03-08 00:16:09,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:16:09,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130930797] [2025-03-08 00:16:09,915 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:16:09,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:16:09,943 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 234 statements into 31 equivalence classes. [2025-03-08 00:16:09,951 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 24 of 234 statements. [2025-03-08 00:16:09,951 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:16:09,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:16:10,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3751 backedges. 88 proven. 117 refuted. 0 times theorem prover too weak. 3546 trivial. 0 not checked. [2025-03-08 00:16:10,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:16:10,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130930797] [2025-03-08 00:16:10,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130930797] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:16:10,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080175396] [2025-03-08 00:16:10,067 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:16:10,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:16:10,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:16:10,069 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:16:10,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 00:16:10,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 234 statements into 31 equivalence classes. [2025-03-08 00:16:10,214 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 24 of 234 statements. [2025-03-08 00:16:10,214 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:16:10,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:16:10,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 00:16:10,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:16:10,229 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 23 treesize of output 1 [2025-03-08 00:16:10,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:16:10,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 15 [2025-03-08 00:16:10,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3751 backedges. 134 proven. 88 refuted. 0 times theorem prover too weak. 3529 trivial. 0 not checked. [2025-03-08 00:16:10,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:16:10,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3751 backedges. 88 proven. 88 refuted. 0 times theorem prover too weak. 3575 trivial. 0 not checked. [2025-03-08 00:16:10,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080175396] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:16:10,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:16:10,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 17 [2025-03-08 00:16:10,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895996620] [2025-03-08 00:16:10,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:16:10,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 00:16:10,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:16:10,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 00:16:10,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:16:10,628 INFO L87 Difference]: Start difference. First operand 327 states and 420 transitions. Second operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:16:14,636 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-08 00:16:15,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:16:15,254 INFO L93 Difference]: Finished difference Result 716 states and 899 transitions. [2025-03-08 00:16:15,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 00:16:15,254 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234 [2025-03-08 00:16:15,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:16:15,260 INFO L225 Difference]: With dead ends: 716 [2025-03-08 00:16:15,260 INFO L226 Difference]: Without dead ends: 711 [2025-03-08 00:16:15,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 458 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=470, Unknown=0, NotChecked=0, Total=650 [2025-03-08 00:16:15,261 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 46 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 15 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:16:15,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 91 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 131 Invalid, 2 Unknown, 0 Unchecked, 4.5s Time] [2025-03-08 00:16:15,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-03-08 00:16:15,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 424. [2025-03-08 00:16:15,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 423 states have (on average 1.3002364066193854) internal successors, (550), 423 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:16:15,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 550 transitions. [2025-03-08 00:16:15,283 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 550 transitions. Word has length 234 [2025-03-08 00:16:15,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:16:15,283 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 550 transitions. [2025-03-08 00:16:15,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:16:15,283 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 550 transitions. [2025-03-08 00:16:15,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-08 00:16:15,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:16:15,285 INFO L218 NwaCegarLoop]: trace histogram [46, 30, 30, 30, 30, 30, 28, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:16:15,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 00:16:15,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:16:15,489 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:16:15,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:16:15,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1068043111, now seen corresponding path program 4 times [2025-03-08 00:16:15,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:16:15,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902598594] [2025-03-08 00:16:15,490 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:16:15,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:16:15,518 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 234 statements into 2 equivalence classes. [2025-03-08 00:16:15,550 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 234 of 234 statements. [2025-03-08 00:16:15,551 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:16:15,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:16:16,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3751 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 2416 trivial. 0 not checked. [2025-03-08 00:16:16,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:16:16,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902598594] [2025-03-08 00:16:16,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902598594] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:16:16,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015319666] [2025-03-08 00:16:16,516 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:16:16,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:16:16,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:16:16,518 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:16:16,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 00:16:16,670 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 234 statements into 2 equivalence classes. [2025-03-08 00:16:19,070 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 234 of 234 statements. [2025-03-08 00:16:19,071 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:16:19,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:16:19,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 1158 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 00:16:19,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:16:19,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3751 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 2416 trivial. 0 not checked. [2025-03-08 00:16:19,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:16:20,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3751 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 2416 trivial. 0 not checked. [2025-03-08 00:16:20,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015319666] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:16:20,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:16:20,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 64 [2025-03-08 00:16:20,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509436394] [2025-03-08 00:16:20,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:16:20,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-03-08 00:16:20,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:16:20,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-03-08 00:16:20,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2025-03-08 00:16:20,304 INFO L87 Difference]: Start difference. First operand 424 states and 550 transitions. Second operand has 64 states, 64 states have (on average 3.078125) internal successors, (197), 64 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:16:21,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:16:21,103 INFO L93 Difference]: Finished difference Result 1193 states and 1701 transitions. [2025-03-08 00:16:21,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-08 00:16:21,103 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 3.078125) internal successors, (197), 64 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234 [2025-03-08 00:16:21,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:16:21,106 INFO L225 Difference]: With dead ends: 1193 [2025-03-08 00:16:21,106 INFO L226 Difference]: Without dead ends: 1002 [2025-03-08 00:16:21,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2025-03-08 00:16:21,107 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 952 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 952 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:16:21,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [952 Valid, 165 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:16:21,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2025-03-08 00:16:21,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 808. [2025-03-08 00:16:21,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 807 states have (on average 1.3159851301115242) internal successors, (1062), 807 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:16:21,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1062 transitions. [2025-03-08 00:16:21,143 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1062 transitions. Word has length 234 [2025-03-08 00:16:21,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:16:21,143 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1062 transitions. [2025-03-08 00:16:21,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 3.078125) internal successors, (197), 64 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:16:21,143 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1062 transitions. [2025-03-08 00:16:21,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-03-08 00:16:21,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:16:21,147 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 62, 62, 60, 46, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:16:21,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 00:16:21,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 00:16:21,348 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:16:21,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:16:21,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1766536857, now seen corresponding path program 5 times [2025-03-08 00:16:21,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:16:21,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120712138] [2025-03-08 00:16:21,349 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:16:21,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:16:21,392 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 426 statements into 63 equivalence classes. [2025-03-08 00:16:23,889 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) and asserted 426 of 426 statements. [2025-03-08 00:16:23,890 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) [2025-03-08 00:16:23,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:16:25,766 INFO L134 CoverageAnalysis]: Checked inductivity of 12551 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 11470 trivial. 0 not checked. [2025-03-08 00:16:25,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:16:25,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120712138] [2025-03-08 00:16:25,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120712138] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:16:25,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512599481] [2025-03-08 00:16:25,767 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:16:25,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:16:25,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:16:25,769 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:16:25,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 00:16:25,966 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 426 statements into 63 equivalence classes.