./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s52if.c --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-fpi/s52if.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash adec1fb94d6967416fde705f346e339b2564f221f40b7d50198f8ed5e502aa54 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:49:59,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:49:59,746 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:49:59,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:49:59,751 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:49:59,769 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:49:59,770 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:49:59,770 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:49:59,770 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:49:59,770 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:49:59,770 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:49:59,770 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:49:59,771 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:49:59,771 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:49:59,771 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:49:59,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:49:59,771 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:49:59,771 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:49:59,771 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:49:59,771 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:49:59,771 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:49:59,771 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:49:59,771 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:49:59,771 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:49:59,771 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:49:59,771 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:49:59,771 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:49:59,771 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:49:59,772 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:49:59,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:49:59,772 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:49:59,772 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:49:59,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:49:59,772 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:49:59,772 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:49:59,772 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:49:59,772 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:49:59,772 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:49:59,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:49:59,772 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:49:59,772 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:49:59,772 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:49:59,772 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:49:59,772 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 -> adec1fb94d6967416fde705f346e339b2564f221f40b7d50198f8ed5e502aa54 [2025-03-08 00:49:59,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:49:59,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:49:59,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:49:59,975 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:49:59,976 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:49:59,976 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s52if.c [2025-03-08 00:50:01,061 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66762854e/997dabac5a404aa99208edf7c4a8923a/FLAG20ddea094 [2025-03-08 00:50:01,264 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:50:01,270 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s52if.c [2025-03-08 00:50:01,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66762854e/997dabac5a404aa99208edf7c4a8923a/FLAG20ddea094 [2025-03-08 00:50:01,615 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66762854e/997dabac5a404aa99208edf7c4a8923a [2025-03-08 00:50:01,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:50:01,618 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:50:01,619 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:50:01,619 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:50:01,621 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:50:01,622 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:50:01" (1/1) ... [2025-03-08 00:50:01,622 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1da22905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:01, skipping insertion in model container [2025-03-08 00:50:01,622 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:50:01" (1/1) ... [2025-03-08 00:50:01,631 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:50:01,729 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-fpi/s52if.c[588,601] [2025-03-08 00:50:01,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:50:01,755 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:50:01,762 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-fpi/s52if.c[588,601] [2025-03-08 00:50:01,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:50:01,781 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:50:01,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:01 WrapperNode [2025-03-08 00:50:01,783 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:50:01,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:50:01,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:50:01,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:50:01,787 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:50:01" (1/1) ... [2025-03-08 00:50:01,797 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:50:01" (1/1) ... [2025-03-08 00:50:01,811 INFO L138 Inliner]: procedures = 17, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2025-03-08 00:50:01,813 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:50:01,813 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:50:01,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:50:01,814 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:50:01,820 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:01" (1/1) ... [2025-03-08 00:50:01,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:01" (1/1) ... [2025-03-08 00:50:01,821 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:01" (1/1) ... [2025-03-08 00:50:01,832 INFO L175 MemorySlicer]: Split 25 memory accesses to 4 slices as follows [2, 8, 6, 9]. 36 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0, 0]. The 6 writes are split as follows [0, 0, 3, 3]. [2025-03-08 00:50:01,835 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:01" (1/1) ... [2025-03-08 00:50:01,835 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:01" (1/1) ... [2025-03-08 00:50:01,843 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:01" (1/1) ... [2025-03-08 00:50:01,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:01" (1/1) ... [2025-03-08 00:50:01,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:01" (1/1) ... [2025-03-08 00:50:01,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:01" (1/1) ... [2025-03-08 00:50:01,850 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:50:01,851 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:50:01,851 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:50:01,851 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:50:01,851 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:01" (1/1) ... [2025-03-08 00:50:01,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:50:01,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:01,879 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:50:01,880 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:50:01,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:50:01,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:50:01,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:50:01,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:50:01,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 00:50:01,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:50:01,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:50:01,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:50:01,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:50:01,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 00:50:01,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 00:50:01,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:50:01,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:50:01,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:50:01,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:50:01,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:50:01,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 00:50:01,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:50:01,947 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:50:01,949 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:50:02,066 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#sum~0#1.base, main_~#sum~0#1.offset);havoc main_~#sum~0#1.base, main_~#sum~0#1.offset; [2025-03-08 00:50:02,071 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 00:50:02,071 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:50:02,076 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:50:02,077 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:50:02,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:50:02 BoogieIcfgContainer [2025-03-08 00:50:02,077 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:50:02,079 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:50:02,079 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:50:02,083 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:50:02,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:50:01" (1/3) ... [2025-03-08 00:50:02,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49da5001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:50:02, skipping insertion in model container [2025-03-08 00:50:02,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:01" (2/3) ... [2025-03-08 00:50:02,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49da5001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:50:02, skipping insertion in model container [2025-03-08 00:50:02,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:50:02" (3/3) ... [2025-03-08 00:50:02,085 INFO L128 eAbstractionObserver]: Analyzing ICFG s52if.c [2025-03-08 00:50:02,095 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:50:02,096 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s52if.c that has 1 procedures, 19 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-08 00:50:02,136 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:50:02,146 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;@e0bbbcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:50:02,146 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:50:02,149 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 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:50:02,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 00:50:02,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:02,153 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:02,155 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:02,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:02,159 INFO L85 PathProgramCache]: Analyzing trace with hash -411444654, now seen corresponding path program 1 times [2025-03-08 00:50:02,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:02,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075367111] [2025-03-08 00:50:02,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:50:02,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:02,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 00:50:02,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 00:50:02,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:02,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:02,261 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:50:02,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:02,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075367111] [2025-03-08 00:50:02,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075367111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:50:02,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:50:02,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:50:02,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434130226] [2025-03-08 00:50:02,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:50:02,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 00:50:02,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:02,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 00:50:02,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:50:02,281 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 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 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:50:02,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:02,288 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2025-03-08 00:50:02,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 00:50:02,289 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2025-03-08 00:50:02,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:02,292 INFO L225 Difference]: With dead ends: 34 [2025-03-08 00:50:02,292 INFO L226 Difference]: Without dead ends: 15 [2025-03-08 00:50:02,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:50:02,296 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:02,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:50:02,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-08 00:50:02,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-08 00:50:02,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 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:50:02,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2025-03-08 00:50:02,315 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 10 [2025-03-08 00:50:02,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:02,315 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-03-08 00:50:02,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:50:02,316 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2025-03-08 00:50:02,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 00:50:02,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:02,317 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:02,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:50:02,318 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:02,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:02,319 INFO L85 PathProgramCache]: Analyzing trace with hash 476059027, now seen corresponding path program 1 times [2025-03-08 00:50:02,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:02,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627723566] [2025-03-08 00:50:02,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:50:02,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:02,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 00:50:02,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 00:50:02,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:02,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:02,428 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:50:02,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:02,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627723566] [2025-03-08 00:50:02,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627723566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:50:02,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:50:02,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:50:02,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308570508] [2025-03-08 00:50:02,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:50:02,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:50:02,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:02,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:50:02,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:50:02,431 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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:50:02,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:02,482 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2025-03-08 00:50:02,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:50:02,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2025-03-08 00:50:02,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:02,483 INFO L225 Difference]: With dead ends: 31 [2025-03-08 00:50:02,483 INFO L226 Difference]: Without dead ends: 22 [2025-03-08 00:50:02,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:50:02,483 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 29 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:02,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 9 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:50:02,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-08 00:50:02,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2025-03-08 00:50:02,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 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:50:02,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-08 00:50:02,487 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2025-03-08 00:50:02,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:02,487 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-08 00:50:02,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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:50:02,487 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-08 00:50:02,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 00:50:02,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:02,488 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:02,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:50:02,488 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:02,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:02,488 INFO L85 PathProgramCache]: Analyzing trace with hash 330064146, now seen corresponding path program 1 times [2025-03-08 00:50:02,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:02,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56930413] [2025-03-08 00:50:02,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:50:02,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:02,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 00:50:02,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:50:02,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:02,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:02,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:50:02,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:02,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56930413] [2025-03-08 00:50:02,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56930413] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:02,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365385017] [2025-03-08 00:50:02,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:50:02,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:02,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:02,989 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:50:02,991 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:50:03,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 00:50:03,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:50:03,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:03,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:03,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 00:50:03,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:03,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:50:03,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 13 [2025-03-08 00:50:03,205 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:50:03,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:03,217 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:03,358 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 14 treesize of output 12 [2025-03-08 00:50:03,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-08 00:50:03,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:03,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365385017] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:03,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:03,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2025-03-08 00:50:03,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9602158] [2025-03-08 00:50:03,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:03,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 00:50:03,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:03,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 00:50:03,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2025-03-08 00:50:03,380 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 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:50:04,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:04,417 INFO L93 Difference]: Finished difference Result 129 states and 184 transitions. [2025-03-08 00:50:04,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-08 00:50:04,418 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 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 17 [2025-03-08 00:50:04,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:04,419 INFO L225 Difference]: With dead ends: 129 [2025-03-08 00:50:04,419 INFO L226 Difference]: Without dead ends: 119 [2025-03-08 00:50:04,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=752, Invalid=3538, Unknown=0, NotChecked=0, Total=4290 [2025-03-08 00:50:04,422 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 244 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:04,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 67 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:50:04,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-08 00:50:04,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 46. [2025-03-08 00:50:04,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 45 states have internal predecessors, (65), 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:50:04,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2025-03-08 00:50:04,436 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 17 [2025-03-08 00:50:04,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:04,437 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2025-03-08 00:50:04,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 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:50:04,437 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2025-03-08 00:50:04,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 00:50:04,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:04,437 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:04,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 00:50:04,638 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:50:04,638 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:04,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:04,639 INFO L85 PathProgramCache]: Analyzing trace with hash 330987667, now seen corresponding path program 1 times [2025-03-08 00:50:04,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:04,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096836729] [2025-03-08 00:50:04,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:50:04,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:04,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 00:50:04,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:50:04,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:04,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:04,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:50:04,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:04,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096836729] [2025-03-08 00:50:04,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096836729] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:04,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66392038] [2025-03-08 00:50:04,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:50:04,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:04,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:04,790 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:50:04,792 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:50:04,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 00:50:04,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:50:04,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:04,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:04,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 00:50:04,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:04,852 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 11 treesize of output 7 [2025-03-08 00:50:04,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:50:04,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:04,886 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 14 treesize of output 12 [2025-03-08 00:50:04,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-08 00:50:04,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:50:04,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66392038] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:04,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:04,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-08 00:50:04,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780788427] [2025-03-08 00:50:04,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:04,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 00:50:04,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:04,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 00:50:04,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:50:04,897 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 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:50:04,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:04,948 INFO L93 Difference]: Finished difference Result 72 states and 100 transitions. [2025-03-08 00:50:04,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:50:04,950 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 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) Word has length 17 [2025-03-08 00:50:04,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:04,950 INFO L225 Difference]: With dead ends: 72 [2025-03-08 00:50:04,950 INFO L226 Difference]: Without dead ends: 38 [2025-03-08 00:50:04,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:50:04,951 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:04,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 37 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:50:04,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-08 00:50:04,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2025-03-08 00:50:04,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 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:50:04,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2025-03-08 00:50:04,957 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 17 [2025-03-08 00:50:04,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:04,957 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2025-03-08 00:50:04,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 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:50:04,957 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2025-03-08 00:50:04,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 00:50:04,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:04,958 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:04,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 00:50:05,163 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:50:05,164 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:05,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:05,164 INFO L85 PathProgramCache]: Analyzing trace with hash 2138442130, now seen corresponding path program 1 times [2025-03-08 00:50:05,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:05,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292293164] [2025-03-08 00:50:05,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:50:05,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:05,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 00:50:05,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:50:05,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:05,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:05,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:50:05,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:05,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292293164] [2025-03-08 00:50:05,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292293164] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:05,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416806480] [2025-03-08 00:50:05,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:50:05,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:05,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:05,348 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:50:05,350 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:50:05,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 00:50:05,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:50:05,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:05,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:05,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 00:50:05,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:05,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2025-03-08 00:50:05,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:50:05,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:05,476 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 27 treesize of output 23 [2025-03-08 00:50:05,483 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 00:50:05,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 16 [2025-03-08 00:50:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:50:05,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416806480] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:05,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:05,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 15 [2025-03-08 00:50:05,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951447601] [2025-03-08 00:50:05,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:05,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 00:50:05,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:05,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 00:50:05,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:50:05,496 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 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:50:05,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:05,605 INFO L93 Difference]: Finished difference Result 73 states and 98 transitions. [2025-03-08 00:50:05,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:50:05,605 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 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 17 [2025-03-08 00:50:05,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:05,606 INFO L225 Difference]: With dead ends: 73 [2025-03-08 00:50:05,606 INFO L226 Difference]: Without dead ends: 62 [2025-03-08 00:50:05,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:50:05,607 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 45 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:05,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 56 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:05,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-08 00:50:05,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 40. [2025-03-08 00:50:05,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 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:50:05,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2025-03-08 00:50:05,613 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 17 [2025-03-08 00:50:05,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:05,614 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 53 transitions. [2025-03-08 00:50:05,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 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:50:05,614 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2025-03-08 00:50:05,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 00:50:05,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:05,614 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:05,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 00:50:05,818 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:50:05,818 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:05,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:05,818 INFO L85 PathProgramCache]: Analyzing trace with hash 658744914, now seen corresponding path program 1 times [2025-03-08 00:50:05,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:05,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372759625] [2025-03-08 00:50:05,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:50:05,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:05,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 00:50:05,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 00:50:05,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:05,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:05,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:50:05,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:05,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372759625] [2025-03-08 00:50:05,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372759625] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:05,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029272509] [2025-03-08 00:50:05,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:50:05,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:05,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:05,880 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:50:05,881 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:50:05,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 00:50:05,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 00:50:05,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:05,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:05,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:50:05,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:05,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:50:05,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:05,983 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:50:05,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029272509] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:05,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:05,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-08 00:50:05,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431430270] [2025-03-08 00:50:05,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:05,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:50:05,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:05,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:50:05,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:50:05,985 INFO L87 Difference]: Start difference. First operand 40 states and 53 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 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:50:06,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:06,105 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2025-03-08 00:50:06,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:50:06,106 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 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:50:06,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:06,106 INFO L225 Difference]: With dead ends: 73 [2025-03-08 00:50:06,106 INFO L226 Difference]: Without dead ends: 65 [2025-03-08 00:50:06,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:50:06,107 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 52 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:06,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 19 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:06,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-08 00:50:06,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 45. [2025-03-08 00:50:06,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 44 states have internal predecessors, (60), 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:50:06,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2025-03-08 00:50:06,113 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 18 [2025-03-08 00:50:06,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:06,114 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2025-03-08 00:50:06,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 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:50:06,114 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2025-03-08 00:50:06,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 00:50:06,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:06,114 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:06,122 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:50:06,317 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:50:06,317 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:06,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:06,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1750087954, now seen corresponding path program 2 times [2025-03-08 00:50:06,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:06,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545474344] [2025-03-08 00:50:06,318 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:50:06,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:06,324 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-08 00:50:06,335 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 00:50:06,335 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:50:06,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:06,394 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:50:06,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:06,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545474344] [2025-03-08 00:50:06,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545474344] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:06,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012647731] [2025-03-08 00:50:06,395 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:50:06,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:06,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:06,398 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:50:06,400 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:50:06,437 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-08 00:50:06,450 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 00:50:06,450 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:50:06,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:06,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:50:06,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:06,484 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:50:06,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:06,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:50:06,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012647731] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:06,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:06,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-08 00:50:06,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498586585] [2025-03-08 00:50:06,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:06,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:50:06,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:06,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:50:06,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:50:06,510 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 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:50:06,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:06,573 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2025-03-08 00:50:06,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:50:06,574 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 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 20 [2025-03-08 00:50:06,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:06,575 INFO L225 Difference]: With dead ends: 66 [2025-03-08 00:50:06,575 INFO L226 Difference]: Without dead ends: 35 [2025-03-08 00:50:06,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:50:06,577 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:06,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 24 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:06,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-08 00:50:06,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2025-03-08 00:50:06,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 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:50:06,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2025-03-08 00:50:06,583 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 20 [2025-03-08 00:50:06,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:06,583 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2025-03-08 00:50:06,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 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:50:06,583 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2025-03-08 00:50:06,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 00:50:06,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:06,583 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:06,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 00:50:06,784 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:50:06,784 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:06,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:06,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2079589618, now seen corresponding path program 1 times [2025-03-08 00:50:06,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:06,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246241661] [2025-03-08 00:50:06,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:50:06,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:06,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:50:06,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:50:06,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:06,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:07,158 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:50:07,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:07,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246241661] [2025-03-08 00:50:07,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246241661] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:07,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92411276] [2025-03-08 00:50:07,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:50:07,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:07,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:07,161 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:50:07,162 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:50:07,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:50:07,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:50:07,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:07,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:07,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 00:50:07,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:07,250 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 11 treesize of output 7 [2025-03-08 00:50:07,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 00:50:07,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2025-03-08 00:50:07,418 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:07,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:07,617 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 17 treesize of output 15 [2025-03-08 00:50:07,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-08 00:50:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:07,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92411276] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:07,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:07,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 32 [2025-03-08 00:50:07,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026350051] [2025-03-08 00:50:07,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:07,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 00:50:07,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:07,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 00:50:07,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2025-03-08 00:50:07,648 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 32 states, 32 states have (on average 1.78125) internal successors, (57), 32 states have internal predecessors, (57), 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:50:10,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:10,515 INFO L93 Difference]: Finished difference Result 249 states and 355 transitions. [2025-03-08 00:50:10,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2025-03-08 00:50:10,516 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.78125) internal successors, (57), 32 states have internal predecessors, (57), 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 24 [2025-03-08 00:50:10,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:10,517 INFO L225 Difference]: With dead ends: 249 [2025-03-08 00:50:10,517 INFO L226 Difference]: Without dead ends: 238 [2025-03-08 00:50:10,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6812 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2198, Invalid=17542, Unknown=0, NotChecked=0, Total=19740 [2025-03-08 00:50:10,521 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 389 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:10,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 109 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 00:50:10,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-08 00:50:10,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 97. [2025-03-08 00:50:10,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 96 states have internal predecessors, (137), 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:50:10,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 137 transitions. [2025-03-08 00:50:10,534 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 137 transitions. Word has length 24 [2025-03-08 00:50:10,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:10,534 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 137 transitions. [2025-03-08 00:50:10,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.78125) internal successors, (57), 32 states have internal predecessors, (57), 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:50:10,534 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 137 transitions. [2025-03-08 00:50:10,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 00:50:10,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:10,535 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:10,541 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:50:10,735 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:50:10,736 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:10,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:10,736 INFO L85 PathProgramCache]: Analyzing trace with hash 2080513139, now seen corresponding path program 1 times [2025-03-08 00:50:10,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:10,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953816807] [2025-03-08 00:50:10,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:50:10,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:10,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:50:10,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:50:10,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:10,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:10,964 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:50:10,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:10,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953816807] [2025-03-08 00:50:10,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953816807] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:10,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422651877] [2025-03-08 00:50:10,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:50:10,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:10,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:10,967 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:50:10,968 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:50:11,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:50:11,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:50:11,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:11,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:11,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 00:50:11,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:11,025 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 11 treesize of output 7 [2025-03-08 00:50:11,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 00:50:11,061 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:50:11,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:11,090 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 16 treesize of output 14 [2025-03-08 00:50:11,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-08 00:50:11,105 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:50:11,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422651877] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:11,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:11,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-08 00:50:11,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228809878] [2025-03-08 00:50:11,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:11,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:50:11,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:11,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:50:11,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:50:11,106 INFO L87 Difference]: Start difference. First operand 97 states and 137 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 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:50:11,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:11,189 INFO L93 Difference]: Finished difference Result 136 states and 190 transitions. [2025-03-08 00:50:11,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:50:11,189 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 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 24 [2025-03-08 00:50:11,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:11,189 INFO L225 Difference]: With dead ends: 136 [2025-03-08 00:50:11,189 INFO L226 Difference]: Without dead ends: 68 [2025-03-08 00:50:11,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:50:11,190 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:11,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 52 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:11,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-08 00:50:11,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2025-03-08 00:50:11,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 56 states have internal predecessors, (74), 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:50:11,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2025-03-08 00:50:11,198 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 24 [2025-03-08 00:50:11,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:11,198 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2025-03-08 00:50:11,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 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:50:11,198 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2025-03-08 00:50:11,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 00:50:11,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:11,199 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:11,207 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:50:11,399 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:50:11,400 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:11,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:11,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1951430420, now seen corresponding path program 1 times [2025-03-08 00:50:11,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:11,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170158777] [2025-03-08 00:50:11,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:50:11,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:11,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:50:11,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:50:11,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:11,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:11,578 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:50:11,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:11,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170158777] [2025-03-08 00:50:11,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170158777] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:11,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508957261] [2025-03-08 00:50:11,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:50:11,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:11,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:11,580 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:50:11,582 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:50:11,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:50:11,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:50:11,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:11,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:11,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 00:50:11,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:11,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2025-03-08 00:50:11,686 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:50:11,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:11,733 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 29 treesize of output 25 [2025-03-08 00:50:11,736 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 00:50:11,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 16 [2025-03-08 00:50:11,752 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:50:11,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508957261] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:11,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:11,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 18 [2025-03-08 00:50:11,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397287532] [2025-03-08 00:50:11,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:11,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 00:50:11,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:11,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 00:50:11,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2025-03-08 00:50:11,753 INFO L87 Difference]: Start difference. First operand 57 states and 74 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 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:50:11,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:11,885 INFO L93 Difference]: Finished difference Result 94 states and 122 transitions. [2025-03-08 00:50:11,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 00:50:11,886 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 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 24 [2025-03-08 00:50:11,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:11,886 INFO L225 Difference]: With dead ends: 94 [2025-03-08 00:50:11,886 INFO L226 Difference]: Without dead ends: 88 [2025-03-08 00:50:11,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:50:11,887 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 48 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:11,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 59 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:11,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-08 00:50:11,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 63. [2025-03-08 00:50:11,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 62 states have internal predecessors, (80), 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:50:11,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2025-03-08 00:50:11,897 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 24 [2025-03-08 00:50:11,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:11,897 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2025-03-08 00:50:11,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 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:50:11,897 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2025-03-08 00:50:11,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:50:11,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:11,898 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:11,905 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:50:12,098 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:50:12,099 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:12,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:12,099 INFO L85 PathProgramCache]: Analyzing trace with hash 62951474, now seen corresponding path program 3 times [2025-03-08 00:50:12,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:12,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203056865] [2025-03-08 00:50:12,099 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:50:12,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:12,106 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-03-08 00:50:12,115 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:50:12,115 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:50:12,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:50:12,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:12,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203056865] [2025-03-08 00:50:12,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203056865] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:12,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932188126] [2025-03-08 00:50:12,189 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:50:12,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:12,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:12,191 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:50:12,192 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:50:12,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-03-08 00:50:12,257 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:50:12,257 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:50:12,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:12,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:50:12,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:12,310 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:50:12,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:12,360 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 00:50:12,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932188126] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:12,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:12,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-08 00:50:12,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669356028] [2025-03-08 00:50:12,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:12,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:50:12,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:12,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:50:12,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:50:12,361 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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:50:12,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:12,512 INFO L93 Difference]: Finished difference Result 108 states and 138 transitions. [2025-03-08 00:50:12,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 00:50:12,512 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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 25 [2025-03-08 00:50:12,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:12,513 INFO L225 Difference]: With dead ends: 108 [2025-03-08 00:50:12,513 INFO L226 Difference]: Without dead ends: 97 [2025-03-08 00:50:12,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:50:12,514 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 62 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:12,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 21 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:12,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-08 00:50:12,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 66. [2025-03-08 00:50:12,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 states have internal predecessors, (85), 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:50:12,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2025-03-08 00:50:12,526 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 85 transitions. Word has length 25 [2025-03-08 00:50:12,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:12,526 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 85 transitions. [2025-03-08 00:50:12,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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:50:12,526 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2025-03-08 00:50:12,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 00:50:12,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:12,529 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:12,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 00:50:12,733 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:50:12,733 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:12,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:12,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1056818256, now seen corresponding path program 4 times [2025-03-08 00:50:12,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:12,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503508181] [2025-03-08 00:50:12,734 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:50:12,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:12,740 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-08 00:50:12,743 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 23 of 27 statements. [2025-03-08 00:50:12,743 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:50:12,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:12,790 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:50:12,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:12,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503508181] [2025-03-08 00:50:12,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503508181] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:12,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337223506] [2025-03-08 00:50:12,791 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:50:12,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:12,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:12,793 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:50:12,794 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:50:12,834 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-08 00:50:12,843 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 23 of 27 statements. [2025-03-08 00:50:12,843 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:50:12,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:12,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:50:12,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:12,890 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:50:12,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:12,918 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:50:12,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337223506] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:12,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:12,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2025-03-08 00:50:12,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635939253] [2025-03-08 00:50:12,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:12,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:50:12,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:12,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:50:12,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:50:12,920 INFO L87 Difference]: Start difference. First operand 66 states and 85 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 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:50:12,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:12,994 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2025-03-08 00:50:12,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:50:12,995 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 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 27 [2025-03-08 00:50:12,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:12,995 INFO L225 Difference]: With dead ends: 96 [2025-03-08 00:50:12,995 INFO L226 Difference]: Without dead ends: 45 [2025-03-08 00:50:12,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:50:12,996 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 29 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:12,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 24 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:12,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-08 00:50:13,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2025-03-08 00:50:13,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 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:50:13,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2025-03-08 00:50:13,007 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 27 [2025-03-08 00:50:13,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:13,007 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-03-08 00:50:13,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 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:50:13,007 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2025-03-08 00:50:13,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 00:50:13,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:13,007 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:13,013 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:50:13,209 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:50:13,210 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:13,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:13,210 INFO L85 PathProgramCache]: Analyzing trace with hash 310323410, now seen corresponding path program 2 times [2025-03-08 00:50:13,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:13,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49739954] [2025-03-08 00:50:13,210 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:50:13,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:13,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-08 00:50:13,230 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:50:13,230 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:50:13,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:13,631 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:50:13,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:13,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49739954] [2025-03-08 00:50:13,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49739954] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:13,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660081112] [2025-03-08 00:50:13,632 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:50:13,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:13,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:13,634 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:50:13,635 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:50:13,679 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-08 00:50:13,696 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:50:13,697 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:50:13,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:13,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-08 00:50:13,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:13,703 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 11 treesize of output 7 [2025-03-08 00:50:13,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2025-03-08 00:50:13,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2025-03-08 00:50:13,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2025-03-08 00:50:13,953 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:50:13,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:14,225 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:50:14,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660081112] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:14,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:14,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 33 [2025-03-08 00:50:14,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486989821] [2025-03-08 00:50:14,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:14,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-08 00:50:14,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:14,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-08 00:50:14,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 00:50:14,226 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 33 states, 33 states have (on average 1.696969696969697) internal successors, (56), 33 states have internal predecessors, (56), 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:50:15,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:15,081 INFO L93 Difference]: Finished difference Result 108 states and 141 transitions. [2025-03-08 00:50:15,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-08 00:50:15,081 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.696969696969697) internal successors, (56), 33 states have internal predecessors, (56), 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 31 [2025-03-08 00:50:15,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:15,082 INFO L225 Difference]: With dead ends: 108 [2025-03-08 00:50:15,082 INFO L226 Difference]: Without dead ends: 101 [2025-03-08 00:50:15,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=377, Invalid=3045, Unknown=0, NotChecked=0, Total=3422 [2025-03-08 00:50:15,083 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 37 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:15,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 73 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:50:15,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-08 00:50:15,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 86. [2025-03-08 00:50:15,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 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:50:15,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 110 transitions. [2025-03-08 00:50:15,095 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 110 transitions. Word has length 31 [2025-03-08 00:50:15,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:15,095 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 110 transitions. [2025-03-08 00:50:15,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.696969696969697) internal successors, (56), 33 states have internal predecessors, (56), 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:50:15,095 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 110 transitions. [2025-03-08 00:50:15,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 00:50:15,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:15,095 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:15,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 00:50:15,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 00:50:15,296 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:15,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:15,296 INFO L85 PathProgramCache]: Analyzing trace with hash 311246931, now seen corresponding path program 2 times [2025-03-08 00:50:15,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:15,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961616153] [2025-03-08 00:50:15,296 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:50:15,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:15,303 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-08 00:50:15,315 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:50:15,316 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:50:15,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:15,489 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:50:15,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:15,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961616153] [2025-03-08 00:50:15,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961616153] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:15,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375502348] [2025-03-08 00:50:15,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:50:15,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:15,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:15,491 INFO L229 MonitoredProcess]: Starting monitored process 13 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:50:15,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 00:50:15,536 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-08 00:50:15,555 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:50:15,555 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:50:15,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:15,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 00:50:15,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:15,594 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 11 treesize of output 7 [2025-03-08 00:50:15,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 00:50:15,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 00:50:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:50:15,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:15,707 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 16 treesize of output 14 [2025-03-08 00:50:15,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-08 00:50:15,712 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:50:15,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375502348] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:15,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:15,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2025-03-08 00:50:15,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29504651] [2025-03-08 00:50:15,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:15,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 00:50:15,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:15,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 00:50:15,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-03-08 00:50:15,713 INFO L87 Difference]: Start difference. First operand 86 states and 110 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 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:50:15,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:15,823 INFO L93 Difference]: Finished difference Result 143 states and 189 transitions. [2025-03-08 00:50:15,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 00:50:15,824 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 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 31 [2025-03-08 00:50:15,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:15,824 INFO L225 Difference]: With dead ends: 143 [2025-03-08 00:50:15,824 INFO L226 Difference]: Without dead ends: 97 [2025-03-08 00:50:15,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:50:15,825 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:15,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 57 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:15,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-08 00:50:15,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2025-03-08 00:50:15,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 87 states have internal predecessors, (112), 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:50:15,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 112 transitions. [2025-03-08 00:50:15,837 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 112 transitions. Word has length 31 [2025-03-08 00:50:15,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:15,837 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 112 transitions. [2025-03-08 00:50:15,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 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:50:15,837 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2025-03-08 00:50:15,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 00:50:15,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:15,837 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:15,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-08 00:50:16,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 00:50:16,038 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:16,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:16,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1196304878, now seen corresponding path program 2 times [2025-03-08 00:50:16,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:16,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414399636] [2025-03-08 00:50:16,038 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:50:16,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:16,043 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-08 00:50:16,065 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:50:16,068 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:50:16,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:16,268 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:50:16,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:16,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414399636] [2025-03-08 00:50:16,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414399636] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:16,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927555586] [2025-03-08 00:50:16,268 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:50:16,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:16,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:16,270 INFO L229 MonitoredProcess]: Starting monitored process 14 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:50:16,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 00:50:16,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-08 00:50:16,336 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:50:16,336 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:50:16,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:16,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 00:50:16,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:16,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2025-03-08 00:50:16,425 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:50:16,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:16,473 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 29 treesize of output 25 [2025-03-08 00:50:16,477 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 00:50:16,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 16 [2025-03-08 00:50:16,502 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:50:16,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927555586] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:16,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:16,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 23 [2025-03-08 00:50:16,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700620358] [2025-03-08 00:50:16,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:16,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 00:50:16,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:16,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 00:50:16,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2025-03-08 00:50:16,503 INFO L87 Difference]: Start difference. First operand 88 states and 112 transitions. Second operand has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 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:50:16,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:16,669 INFO L93 Difference]: Finished difference Result 123 states and 157 transitions. [2025-03-08 00:50:16,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 00:50:16,670 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 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 31 [2025-03-08 00:50:16,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:16,671 INFO L225 Difference]: With dead ends: 123 [2025-03-08 00:50:16,671 INFO L226 Difference]: Without dead ends: 117 [2025-03-08 00:50:16,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:50:16,671 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 76 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:16,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 71 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:16,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-08 00:50:16,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 94. [2025-03-08 00:50:16,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.2688172043010753) internal successors, (118), 93 states have internal predecessors, (118), 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:50:16,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 118 transitions. [2025-03-08 00:50:16,684 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 118 transitions. Word has length 31 [2025-03-08 00:50:16,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:16,684 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 118 transitions. [2025-03-08 00:50:16,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 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:50:16,685 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 118 transitions. [2025-03-08 00:50:16,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 00:50:16,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:16,685 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:16,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-08 00:50:16,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 00:50:16,889 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:16,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:16,890 INFO L85 PathProgramCache]: Analyzing trace with hash 480931090, now seen corresponding path program 5 times [2025-03-08 00:50:16,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:16,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572038549] [2025-03-08 00:50:16,890 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:50:16,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:16,896 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 4 equivalence classes. [2025-03-08 00:50:16,903 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 00:50:16,903 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-08 00:50:16,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:16,980 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:50:16,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:16,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572038549] [2025-03-08 00:50:16,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572038549] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:16,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180034097] [2025-03-08 00:50:16,981 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:50:16,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:16,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:16,983 INFO L229 MonitoredProcess]: Starting monitored process 15 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:50:16,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 00:50:17,031 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 4 equivalence classes. [2025-03-08 00:50:17,064 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 00:50:17,064 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-08 00:50:17,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:17,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 00:50:17,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:17,118 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:50:17,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:17,171 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:50:17,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180034097] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:17,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:17,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 15 [2025-03-08 00:50:17,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254696506] [2025-03-08 00:50:17,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:17,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 00:50:17,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:17,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 00:50:17,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:50:17,172 INFO L87 Difference]: Start difference. First operand 94 states and 118 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 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:50:17,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:17,385 INFO L93 Difference]: Finished difference Result 140 states and 174 transitions. [2025-03-08 00:50:17,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 00:50:17,385 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 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 32 [2025-03-08 00:50:17,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:17,386 INFO L225 Difference]: With dead ends: 140 [2025-03-08 00:50:17,386 INFO L226 Difference]: Without dead ends: 124 [2025-03-08 00:50:17,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 51 SyntacticMatches, 9 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2025-03-08 00:50:17,386 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 79 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:17,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 21 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:17,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-08 00:50:17,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 86. [2025-03-08 00:50:17,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 85 states have internal predecessors, (108), 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:50:17,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2025-03-08 00:50:17,415 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 32 [2025-03-08 00:50:17,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:17,415 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2025-03-08 00:50:17,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 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:50:17,415 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2025-03-08 00:50:17,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 00:50:17,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:17,415 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:17,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-08 00:50:17,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:17,616 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:17,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:17,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1104470894, now seen corresponding path program 6 times [2025-03-08 00:50:17,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:17,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466491781] [2025-03-08 00:50:17,616 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:50:17,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:17,623 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 5 equivalence classes. [2025-03-08 00:50:17,639 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:50:17,639 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-08 00:50:17,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:17,713 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:50:17,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:17,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466491781] [2025-03-08 00:50:17,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466491781] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:17,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254028111] [2025-03-08 00:50:17,714 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:50:17,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:17,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:17,717 INFO L229 MonitoredProcess]: Starting monitored process 16 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:50:17,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 00:50:17,767 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 5 equivalence classes. [2025-03-08 00:50:17,799 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:50:17,799 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-08 00:50:17,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:17,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 00:50:17,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:17,870 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:50:17,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:17,926 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:50:17,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254028111] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:17,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:17,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2025-03-08 00:50:17,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839528489] [2025-03-08 00:50:17,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:17,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 00:50:17,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:17,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 00:50:17,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:50:17,927 INFO L87 Difference]: Start difference. First operand 86 states and 108 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 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:50:18,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:18,047 INFO L93 Difference]: Finished difference Result 125 states and 153 transitions. [2025-03-08 00:50:18,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 00:50:18,048 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 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 34 [2025-03-08 00:50:18,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:18,048 INFO L225 Difference]: With dead ends: 125 [2025-03-08 00:50:18,048 INFO L226 Difference]: Without dead ends: 55 [2025-03-08 00:50:18,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 55 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:50:18,049 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 63 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:18,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 35 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:18,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-08 00:50:18,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2025-03-08 00:50:18,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 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:50:18,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2025-03-08 00:50:18,057 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 34 [2025-03-08 00:50:18,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:18,057 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2025-03-08 00:50:18,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 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:50:18,057 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2025-03-08 00:50:18,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 00:50:18,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:18,058 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:18,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-08 00:50:18,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 00:50:18,258 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:18,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:18,259 INFO L85 PathProgramCache]: Analyzing trace with hash 531594162, now seen corresponding path program 3 times [2025-03-08 00:50:18,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:18,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258673644] [2025-03-08 00:50:18,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:50:18,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:18,265 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 5 equivalence classes. [2025-03-08 00:50:18,284 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:50:18,284 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 00:50:18,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:18,923 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 00:50:18,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:18,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258673644] [2025-03-08 00:50:18,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258673644] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:18,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346436564] [2025-03-08 00:50:18,924 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:50:18,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:18,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:18,926 INFO L229 MonitoredProcess]: Starting monitored process 17 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:50:18,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 00:50:18,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 5 equivalence classes. [2025-03-08 00:50:19,025 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:50:19,025 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 00:50:19,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:19,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 00:50:19,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:19,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-08 00:50:19,174 INFO L349 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2025-03-08 00:50:19,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2025-03-08 00:50:19,216 INFO L349 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2025-03-08 00:50:19,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2025-03-08 00:50:19,258 INFO L349 Elim1Store]: treesize reduction 28, result has 39.1 percent of original size [2025-03-08 00:50:19,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 22 [2025-03-08 00:50:19,363 INFO L349 Elim1Store]: treesize reduction 21, result has 58.0 percent of original size [2025-03-08 00:50:19,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 45 [2025-03-08 00:50:19,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:19,518 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 24 treesize of output 17 [2025-03-08 00:50:19,584 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:50:19,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:53,423 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 26 treesize of output 24 [2025-03-08 00:50:53,497 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:50:53,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346436564] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:53,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:53,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 20] total 52 [2025-03-08 00:50:53,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727812671] [2025-03-08 00:50:53,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:53,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-08 00:50:53,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:53,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-08 00:50:53,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=2243, Unknown=7, NotChecked=0, Total=2652 [2025-03-08 00:50:53,498 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 52 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 52 states have internal predecessors, (81), 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:50:55,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:55,273 INFO L93 Difference]: Finished difference Result 146 states and 178 transitions. [2025-03-08 00:50:55,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-08 00:50:55,273 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 52 states have internal predecessors, (81), 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 38 [2025-03-08 00:50:55,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:55,273 INFO L225 Difference]: With dead ends: 146 [2025-03-08 00:50:55,273 INFO L226 Difference]: Without dead ends: 116 [2025-03-08 00:50:55,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2675 ImplicationChecksByTransitivity, 35.6s TimeCoverageRelationStatistics Valid=1733, Invalid=7962, Unknown=7, NotChecked=0, Total=9702 [2025-03-08 00:50:55,275 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 404 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:55,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 64 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:50:55,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-08 00:50:55,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 94. [2025-03-08 00:50:55,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.2258064516129032) internal successors, (114), 93 states have internal predecessors, (114), 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:50:55,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2025-03-08 00:50:55,290 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 38 [2025-03-08 00:50:55,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:55,290 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2025-03-08 00:50:55,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 52 states have internal predecessors, (81), 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:50:55,290 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2025-03-08 00:50:55,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 00:50:55,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:55,290 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:55,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-08 00:50:55,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 00:50:55,491 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:55,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:55,491 INFO L85 PathProgramCache]: Analyzing trace with hash 532517683, now seen corresponding path program 3 times [2025-03-08 00:50:55,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:55,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933717173] [2025-03-08 00:50:55,492 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:50:55,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:55,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 5 equivalence classes. [2025-03-08 00:50:55,508 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:50:55,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 00:50:55,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:55,863 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 00:50:55,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:55,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933717173] [2025-03-08 00:50:55,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933717173] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:55,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313876499] [2025-03-08 00:50:55,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:50:55,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:55,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:55,866 INFO L229 MonitoredProcess]: Starting monitored process 18 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:50:55,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 00:50:55,930 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 5 equivalence classes. [2025-03-08 00:50:55,987 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:50:55,987 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 00:50:55,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:55,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-08 00:50:55,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:56,009 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 13 treesize of output 9 [2025-03-08 00:50:56,076 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-03-08 00:50:56,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-03-08 00:50:56,141 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-03-08 00:50:56,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2025-03-08 00:50:56,196 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2025-03-08 00:50:56,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 28 [2025-03-08 00:50:56,320 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2025-03-08 00:50:56,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 53 [2025-03-08 00:50:56,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:56,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:56,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:56,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 19 [2025-03-08 00:50:56,691 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 20 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:50:56,691 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:57,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 84 [2025-03-08 00:50:57,564 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 11 proven. 37 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:50:57,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313876499] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:57,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:57,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 21] total 51 [2025-03-08 00:50:57,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644351501] [2025-03-08 00:50:57,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:57,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-08 00:50:57,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:57,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-08 00:50:57,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=2086, Unknown=0, NotChecked=0, Total=2550 [2025-03-08 00:50:57,566 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand has 51 states, 51 states have (on average 1.7058823529411764) internal successors, (87), 51 states have internal predecessors, (87), 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:51:00,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:51:00,245 INFO L93 Difference]: Finished difference Result 131 states and 161 transitions. [2025-03-08 00:51:00,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-03-08 00:51:00,245 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.7058823529411764) internal successors, (87), 51 states have internal predecessors, (87), 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 38 [2025-03-08 00:51:00,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:51:00,246 INFO L225 Difference]: With dead ends: 131 [2025-03-08 00:51:00,246 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 00:51:00,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3802 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1898, Invalid=10311, Unknown=1, NotChecked=0, Total=12210 [2025-03-08 00:51:00,248 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 199 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:51:00,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 54 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:51:00,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 00:51:00,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 74. [2025-03-08 00:51:00,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 73 states have internal predecessors, (87), 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:51:00,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2025-03-08 00:51:00,260 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 87 transitions. Word has length 38 [2025-03-08 00:51:00,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:51:00,260 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 87 transitions. [2025-03-08 00:51:00,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.7058823529411764) internal successors, (87), 51 states have internal predecessors, (87), 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:51:00,260 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2025-03-08 00:51:00,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 00:51:00,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:51:00,261 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:51:00,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-08 00:51:00,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:51:00,461 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:51:00,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:51:00,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1528666515, now seen corresponding path program 7 times [2025-03-08 00:51:00,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:51:00,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734425785] [2025-03-08 00:51:00,462 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:51:00,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:51:00,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 00:51:00,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:51:00,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:51:00,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:00,907 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 00:51:00,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:51:00,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734425785] [2025-03-08 00:51:00,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734425785] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:51:00,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457450467] [2025-03-08 00:51:00,907 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:51:00,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:51:00,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:51:00,909 INFO L229 MonitoredProcess]: Starting monitored process 19 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:51:00,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-08 00:51:00,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 00:51:00,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:51:00,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:51:00,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:00,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-08 00:51:00,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:51:00,986 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 11 treesize of output 7 [2025-03-08 00:51:01,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2025-03-08 00:51:01,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2025-03-08 00:51:01,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2025-03-08 00:51:01,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2025-03-08 00:51:01,393 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 00:51:01,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:51:01,831 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 00:51:01,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457450467] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:51:01,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:51:01,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 42 [2025-03-08 00:51:01,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633917647] [2025-03-08 00:51:01,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:51:01,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-08 00:51:01,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:51:01,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-08 00:51:01,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1585, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 00:51:01,832 INFO L87 Difference]: Start difference. First operand 74 states and 87 transitions. Second operand has 42 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 42 states have internal predecessors, (64), 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:51:02,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:51:02,609 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2025-03-08 00:51:02,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-08 00:51:02,610 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 42 states have internal predecessors, (64), 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 38 [2025-03-08 00:51:02,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:51:02,610 INFO L225 Difference]: With dead ends: 94 [2025-03-08 00:51:02,610 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 00:51:02,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=266, Invalid=2814, Unknown=0, NotChecked=0, Total=3080 [2025-03-08 00:51:02,611 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 24 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:51:02,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 106 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:51:02,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 00:51:02,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2025-03-08 00:51:02,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.1728395061728396) internal successors, (95), 81 states have internal predecessors, (95), 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:51:02,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 95 transitions. [2025-03-08 00:51:02,625 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 95 transitions. Word has length 38 [2025-03-08 00:51:02,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:51:02,625 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 95 transitions. [2025-03-08 00:51:02,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 42 states have internal predecessors, (64), 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:51:02,625 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 95 transitions. [2025-03-08 00:51:02,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 00:51:02,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:51:02,625 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:51:02,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-08 00:51:02,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:51:02,826 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:51:02,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:51:02,826 INFO L85 PathProgramCache]: Analyzing trace with hash -380712974, now seen corresponding path program 8 times [2025-03-08 00:51:02,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:51:02,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109854123] [2025-03-08 00:51:02,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:51:02,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:51:02,832 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-08 00:51:02,837 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 00:51:02,839 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:51:02,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:02,950 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 00:51:02,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:51:02,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109854123] [2025-03-08 00:51:02,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109854123] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:51:02,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120195313] [2025-03-08 00:51:02,951 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:51:02,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:51:02,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:51:02,953 INFO L229 MonitoredProcess]: Starting monitored process 20 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:51:02,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-08 00:51:03,020 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-08 00:51:03,039 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 00:51:03,040 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:51:03,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:03,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:51:03,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:51:03,134 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 00:51:03,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:51:03,199 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 00:51:03,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120195313] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:51:03,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:51:03,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2025-03-08 00:51:03,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477167600] [2025-03-08 00:51:03,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:51:03,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 00:51:03,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:51:03,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 00:51:03,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:51:03,200 INFO L87 Difference]: Start difference. First operand 82 states and 95 transitions. Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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:51:03,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:51:03,482 INFO L93 Difference]: Finished difference Result 128 states and 153 transitions. [2025-03-08 00:51:03,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 00:51:03,483 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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 39 [2025-03-08 00:51:03,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:51:03,483 INFO L225 Difference]: With dead ends: 128 [2025-03-08 00:51:03,483 INFO L226 Difference]: Without dead ends: 112 [2025-03-08 00:51:03,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 61 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2025-03-08 00:51:03,484 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 111 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:51:03,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 37 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:51:03,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-08 00:51:03,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 83. [2025-03-08 00:51:03,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.2073170731707317) internal successors, (99), 82 states have internal predecessors, (99), 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:51:03,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2025-03-08 00:51:03,499 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 39 [2025-03-08 00:51:03,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:51:03,499 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2025-03-08 00:51:03,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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:51:03,499 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2025-03-08 00:51:03,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 00:51:03,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:51:03,500 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:51:03,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-08 00:51:03,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:51:03,700 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:51:03,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:51:03,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1084246608, now seen corresponding path program 9 times [2025-03-08 00:51:03,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:51:03,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875700400] [2025-03-08 00:51:03,701 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:51:03,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:51:03,706 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 6 equivalence classes. [2025-03-08 00:51:03,718 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 00:51:03,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 00:51:03,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:03,861 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 00:51:03,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:51:03,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875700400] [2025-03-08 00:51:03,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875700400] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:51:03,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264399506] [2025-03-08 00:51:03,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:51:03,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:51:03,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:51:03,864 INFO L229 MonitoredProcess]: Starting monitored process 21 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:51:03,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-08 00:51:03,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 6 equivalence classes. [2025-03-08 00:51:03,966 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 00:51:03,966 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 00:51:03,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:03,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:51:03,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:51:04,092 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:51:04,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:51:04,210 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:51:04,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264399506] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:51:04,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:51:04,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 28 [2025-03-08 00:51:04,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049166686] [2025-03-08 00:51:04,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:51:04,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 00:51:04,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:51:04,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 00:51:04,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2025-03-08 00:51:04,211 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand has 28 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 28 states have internal predecessors, (75), 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:51:04,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:51:04,390 INFO L93 Difference]: Finished difference Result 118 states and 140 transitions. [2025-03-08 00:51:04,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 00:51:04,390 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 28 states have internal predecessors, (75), 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 41 [2025-03-08 00:51:04,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:51:04,391 INFO L225 Difference]: With dead ends: 118 [2025-03-08 00:51:04,391 INFO L226 Difference]: Without dead ends: 84 [2025-03-08 00:51:04,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=748, Unknown=0, NotChecked=0, Total=992 [2025-03-08 00:51:04,392 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 96 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:51:04,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 34 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:51:04,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-08 00:51:04,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 70. [2025-03-08 00:51:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 69 states have internal predecessors, (85), 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:51:04,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2025-03-08 00:51:04,406 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 41 [2025-03-08 00:51:04,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:51:04,406 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2025-03-08 00:51:04,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 28 states have internal predecessors, (75), 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:51:04,406 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2025-03-08 00:51:04,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 00:51:04,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:51:04,406 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:51:04,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-08 00:51:04,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-08 00:51:04,607 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:51:04,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:51:04,607 INFO L85 PathProgramCache]: Analyzing trace with hash 449866224, now seen corresponding path program 4 times [2025-03-08 00:51:04,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:51:04,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679264107] [2025-03-08 00:51:04,607 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:51:04,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:51:04,613 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-03-08 00:51:04,620 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 41 of 45 statements. [2025-03-08 00:51:04,620 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:51:04,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:04,853 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 00:51:04,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:51:04,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679264107] [2025-03-08 00:51:04,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679264107] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:51:04,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815937584] [2025-03-08 00:51:04,854 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:51:04,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:51:04,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:51:04,856 INFO L229 MonitoredProcess]: Starting monitored process 22 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:51:04,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-08 00:51:04,924 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-03-08 00:51:04,939 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 41 of 45 statements. [2025-03-08 00:51:04,940 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:51:04,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:04,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-08 00:51:04,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:51:04,945 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 16 treesize of output 12 [2025-03-08 00:51:04,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 16 [2025-03-08 00:51:05,003 INFO L349 Elim1Store]: treesize reduction 22, result has 42.1 percent of original size [2025-03-08 00:51:05,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2025-03-08 00:51:05,053 INFO L349 Elim1Store]: treesize reduction 24, result has 40.0 percent of original size [2025-03-08 00:51:05,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 24 [2025-03-08 00:51:05,105 INFO L349 Elim1Store]: treesize reduction 24, result has 40.0 percent of original size [2025-03-08 00:51:05,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 27 [2025-03-08 00:51:05,192 INFO L349 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2025-03-08 00:51:05,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 45 [2025-03-08 00:51:05,301 INFO L349 Elim1Store]: treesize reduction 32, result has 33.3 percent of original size [2025-03-08 00:51:05,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 33 [2025-03-08 00:51:05,358 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-08 00:51:05,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:51:06,011 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 26 proven. 51 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 00:51:06,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815937584] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:51:06,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:51:06,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 22] total 45 [2025-03-08 00:51:06,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146176469] [2025-03-08 00:51:06,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:51:06,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-08 00:51:06,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:51:06,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-08 00:51:06,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=1695, Unknown=0, NotChecked=0, Total=1980 [2025-03-08 00:51:06,012 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 45 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 45 states have internal predecessors, (74), 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:51:07,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:51:07,787 INFO L93 Difference]: Finished difference Result 139 states and 176 transitions. [2025-03-08 00:51:07,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-08 00:51:07,787 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 45 states have internal predecessors, (74), 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 45 [2025-03-08 00:51:07,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:51:07,788 INFO L225 Difference]: With dead ends: 139 [2025-03-08 00:51:07,788 INFO L226 Difference]: Without dead ends: 109 [2025-03-08 00:51:07,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2214 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1383, Invalid=6099, Unknown=0, NotChecked=0, Total=7482 [2025-03-08 00:51:07,788 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 60 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:51:07,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 90 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 00:51:07,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-08 00:51:07,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 73. [2025-03-08 00:51:07,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 72 states have internal predecessors, (89), 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:51:07,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2025-03-08 00:51:07,804 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 45 [2025-03-08 00:51:07,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:51:07,804 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2025-03-08 00:51:07,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 45 states have internal predecessors, (74), 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:51:07,804 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2025-03-08 00:51:07,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 00:51:07,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:51:07,805 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:51:07,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-08 00:51:08,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-08 00:51:08,005 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:51:08,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:51:08,006 INFO L85 PathProgramCache]: Analyzing trace with hash 516872977, now seen corresponding path program 10 times [2025-03-08 00:51:08,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:51:08,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280556990] [2025-03-08 00:51:08,006 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:51:08,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:51:08,012 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-03-08 00:51:08,019 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 00:51:08,019 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:51:08,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:08,584 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 00:51:08,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:51:08,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280556990] [2025-03-08 00:51:08,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280556990] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:51:08,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080892638] [2025-03-08 00:51:08,585 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:51:08,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:51:08,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:51:08,586 INFO L229 MonitoredProcess]: Starting monitored process 23 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:51:08,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-08 00:51:08,651 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-03-08 00:51:08,692 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 00:51:08,692 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:51:08,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:08,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-03-08 00:51:08,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:51:08,701 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 11 treesize of output 7 [2025-03-08 00:51:08,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2025-03-08 00:51:08,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2025-03-08 00:51:08,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2025-03-08 00:51:09,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2025-03-08 00:51:09,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2025-03-08 00:51:09,187 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 00:51:09,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:51:09,889 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 00:51:09,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080892638] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:51:09,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:51:09,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20, 20] total 51 [2025-03-08 00:51:09,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567133366] [2025-03-08 00:51:09,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:51:09,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-08 00:51:09,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:51:09,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-08 00:51:09,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2381, Unknown=0, NotChecked=0, Total=2550 [2025-03-08 00:51:09,890 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand has 51 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 51 states have internal predecessors, (75), 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:51:12,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:51:12,707 INFO L93 Difference]: Finished difference Result 211 states and 274 transitions. [2025-03-08 00:51:12,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-03-08 00:51:12,708 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 51 states have internal predecessors, (75), 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 45 [2025-03-08 00:51:12,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:51:12,708 INFO L225 Difference]: With dead ends: 211 [2025-03-08 00:51:12,708 INFO L226 Difference]: Without dead ends: 199 [2025-03-08 00:51:12,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2786 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=780, Invalid=10350, Unknown=0, NotChecked=0, Total=11130 [2025-03-08 00:51:12,710 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 74 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 2801 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 2964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 2801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:51:12,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 112 Invalid, 2964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 2801 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 00:51:12,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-08 00:51:12,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 161. [2025-03-08 00:51:12,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.29375) internal successors, (207), 160 states have internal predecessors, (207), 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:51:12,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 207 transitions. [2025-03-08 00:51:12,746 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 207 transitions. Word has length 45 [2025-03-08 00:51:12,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:51:12,746 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 207 transitions. [2025-03-08 00:51:12,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 51 states have internal predecessors, (75), 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:51:12,746 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 207 transitions. [2025-03-08 00:51:12,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 00:51:12,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:51:12,746 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:51:12,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-08 00:51:12,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:51:12,947 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:51:12,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:51:12,947 INFO L85 PathProgramCache]: Analyzing trace with hash -2035283984, now seen corresponding path program 3 times [2025-03-08 00:51:12,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:51:12,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48780238] [2025-03-08 00:51:12,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:51:12,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:51:12,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 6 equivalence classes. [2025-03-08 00:51:12,968 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 33 of 45 statements. [2025-03-08 00:51:12,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 00:51:12,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:13,373 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 00:51:13,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:51:13,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48780238] [2025-03-08 00:51:13,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48780238] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:51:13,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356391497] [2025-03-08 00:51:13,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:51:13,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:51:13,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:51:13,375 INFO L229 MonitoredProcess]: Starting monitored process 24 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:51:13,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-08 00:51:13,442 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 6 equivalence classes. [2025-03-08 00:51:13,465 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 33 of 45 statements. [2025-03-08 00:51:13,465 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 00:51:13,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:13,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 00:51:13,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:51:13,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 13 [2025-03-08 00:51:13,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 00:51:13,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:51:13,663 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 17 [2025-03-08 00:51:13,733 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 20 proven. 40 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 00:51:13,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:51:13,924 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 20 proven. 26 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 00:51:13,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356391497] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:51:13,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:51:13,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 13] total 37 [2025-03-08 00:51:13,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892700428] [2025-03-08 00:51:13,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:51:13,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-08 00:51:13,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:51:13,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-08 00:51:13,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1184, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 00:51:13,925 INFO L87 Difference]: Start difference. First operand 161 states and 207 transitions. Second operand has 37 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 37 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:51:19,177 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:51:37,503 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]