./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s4if.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/s4if.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 5fe0a71bff946f0cc68d0dab1416e0ef991c6bf06ad7cbb70643ca18073a3c7e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:49:39,651 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:49:39,696 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:39,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:49:39,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:49:39,722 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:49:39,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:49:39,723 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:49:39,723 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:49:39,724 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:49:39,724 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:49:39,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:49:39,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:49:39,725 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:49:39,725 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:49:39,725 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:49:39,725 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:49:39,725 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:49:39,725 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:49:39,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:49:39,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:49:39,726 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:49:39,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:49:39,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:49:39,727 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:49:39,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:49:39,727 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:49:39,727 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:49:39,727 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:49:39,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:49:39,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:49:39,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:49:39,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:49:39,727 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:49:39,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:49:39,728 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:49:39,728 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:49:39,728 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:49:39,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:49:39,728 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:49:39,728 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:49:39,728 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:49:39,728 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:49:39,728 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 -> 5fe0a71bff946f0cc68d0dab1416e0ef991c6bf06ad7cbb70643ca18073a3c7e [2025-03-08 00:49:39,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:49:39,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:49:39,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:49:39,948 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:49:39,948 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:49:39,949 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s4if.c [2025-03-08 00:49:41,006 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e68ffa793/6ce505f576744c34802b0b47da4662d7/FLAG0741c5058 [2025-03-08 00:49:41,207 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:49:41,207 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s4if.c [2025-03-08 00:49:41,214 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e68ffa793/6ce505f576744c34802b0b47da4662d7/FLAG0741c5058 [2025-03-08 00:49:41,223 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e68ffa793/6ce505f576744c34802b0b47da4662d7 [2025-03-08 00:49:41,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:49:41,226 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:49:41,227 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:49:41,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:49:41,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:49:41,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:49:41" (1/1) ... [2025-03-08 00:49:41,232 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a07393c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:41, skipping insertion in model container [2025-03-08 00:49:41,232 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:49:41" (1/1) ... [2025-03-08 00:49:41,240 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:49:41,340 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/s4if.c[587,600] [2025-03-08 00:49:41,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:49:41,366 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:49:41,373 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/s4if.c[587,600] [2025-03-08 00:49:41,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:49:41,393 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:49:41,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:41 WrapperNode [2025-03-08 00:49:41,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:49:41,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:49:41,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:49:41,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:49:41,400 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:49:41" (1/1) ... [2025-03-08 00:49:41,407 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:49:41" (1/1) ... [2025-03-08 00:49:41,422 INFO L138 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2025-03-08 00:49:41,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:49:41,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:49:41,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:49:41,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:49:41,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:41" (1/1) ... [2025-03-08 00:49:41,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:41" (1/1) ... [2025-03-08 00:49:41,431 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:41" (1/1) ... [2025-03-08 00:49:41,446 INFO L175 MemorySlicer]: Split 19 memory accesses to 4 slices as follows [2, 7, 6, 4]. 37 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0]. The 4 writes are split as follows [0, 0, 3, 1]. [2025-03-08 00:49:41,447 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:41" (1/1) ... [2025-03-08 00:49:41,447 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:41" (1/1) ... [2025-03-08 00:49:41,450 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:41" (1/1) ... [2025-03-08 00:49:41,450 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:41" (1/1) ... [2025-03-08 00:49:41,451 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:41" (1/1) ... [2025-03-08 00:49:41,451 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:41" (1/1) ... [2025-03-08 00:49:41,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:49:41,454 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:49:41,454 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:49:41,454 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:49:41,454 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:41" (1/1) ... [2025-03-08 00:49:41,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:49:41,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:41,479 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:49:41,484 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:49:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:49:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:49:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:49:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:49:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 00:49:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:49:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:49:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:49:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:49:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 00:49:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 00:49:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:49:41,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:49:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:49:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:49:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:49:41,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 00:49:41,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:49:41,562 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:49:41,563 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:49:41,681 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:49:41,689 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 00:49:41,689 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:49:41,696 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:49:41,697 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:49:41,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:49:41 BoogieIcfgContainer [2025-03-08 00:49:41,697 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:49:41,699 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:49:41,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:49:41,702 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:49:41,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:49:41" (1/3) ... [2025-03-08 00:49:41,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ffaa4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:49:41, skipping insertion in model container [2025-03-08 00:49:41,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:49:41" (2/3) ... [2025-03-08 00:49:41,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ffaa4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:49:41, skipping insertion in model container [2025-03-08 00:49:41,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:49:41" (3/3) ... [2025-03-08 00:49:41,705 INFO L128 eAbstractionObserver]: Analyzing ICFG s4if.c [2025-03-08 00:49:41,716 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:49:41,718 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s4if.c that has 1 procedures, 16 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 00:49:41,760 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:49:41,770 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;@3e442785, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:49:41,770 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:49:41,774 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 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:49:41,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 00:49:41,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:41,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:41,779 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:41,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:41,783 INFO L85 PathProgramCache]: Analyzing trace with hash -673256721, now seen corresponding path program 1 times [2025-03-08 00:49:41,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:41,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106347345] [2025-03-08 00:49:41,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:49:41,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:41,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 00:49:41,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 00:49:41,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:49:41,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:41,915 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:49:41,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:41,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106347345] [2025-03-08 00:49:41,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106347345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:49:41,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:49:41,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:49:41,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096475989] [2025-03-08 00:49:41,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:49:41,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 00:49:41,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:41,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 00:49:41,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:49:41,935 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:41,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:41,941 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2025-03-08 00:49:41,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 00:49:41,942 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 00:49:41,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:41,946 INFO L225 Difference]: With dead ends: 28 [2025-03-08 00:49:41,946 INFO L226 Difference]: Without dead ends: 12 [2025-03-08 00:49:41,949 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:49:41,950 INFO L435 NwaCegarLoop]: 19 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, 19 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:49:41,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:49:41,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-08 00:49:41,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-08 00:49:41,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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:49:41,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2025-03-08 00:49:41,966 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2025-03-08 00:49:41,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:41,967 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-03-08 00:49:41,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:41,967 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2025-03-08 00:49:41,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 00:49:41,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:41,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:41,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:49:41,967 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:41,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:41,970 INFO L85 PathProgramCache]: Analyzing trace with hash -644627570, now seen corresponding path program 1 times [2025-03-08 00:49:41,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:41,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82094025] [2025-03-08 00:49:41,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:49:41,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:41,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 00:49:42,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 00:49:42,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:49:42,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:42,085 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:49:42,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:42,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82094025] [2025-03-08 00:49:42,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82094025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:49:42,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:49:42,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:49:42,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918716397] [2025-03-08 00:49:42,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:49:42,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:49:42,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:42,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:49:42,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:49:42,091 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:42,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:42,132 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2025-03-08 00:49:42,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:49:42,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 00:49:42,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:42,133 INFO L225 Difference]: With dead ends: 22 [2025-03-08 00:49:42,133 INFO L226 Difference]: Without dead ends: 16 [2025-03-08 00:49:42,133 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:49:42,134 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:42,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 9 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:49:42,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-08 00:49:42,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2025-03-08 00:49:42,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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:49:42,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2025-03-08 00:49:42,136 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2025-03-08 00:49:42,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:42,137 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2025-03-08 00:49:42,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:42,137 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2025-03-08 00:49:42,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 00:49:42,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:42,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:42,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:49:42,137 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:42,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:42,138 INFO L85 PathProgramCache]: Analyzing trace with hash 380854543, now seen corresponding path program 1 times [2025-03-08 00:49:42,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:42,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114150696] [2025-03-08 00:49:42,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:49:42,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:42,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 00:49:42,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 00:49:42,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:49:42,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:42,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:42,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:42,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114150696] [2025-03-08 00:49:42,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114150696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:42,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212470563] [2025-03-08 00:49:42,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:49:42,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:42,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:42,634 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:49:42,635 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:49:42,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 00:49:42,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 00:49:42,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:49:42,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:42,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 00:49:42,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:42,747 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:49:42,874 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:49:42,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:42,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:43,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:43,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212470563] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:43,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:43,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-08 00:49:43,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684819539] [2025-03-08 00:49:43,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:43,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 00:49:43,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:43,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 00:49:43,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:49:43,031 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 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:49:43,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:43,267 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2025-03-08 00:49:43,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:49:43,268 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 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 13 [2025-03-08 00:49:43,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:43,268 INFO L225 Difference]: With dead ends: 26 [2025-03-08 00:49:43,269 INFO L226 Difference]: Without dead ends: 23 [2025-03-08 00:49:43,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2025-03-08 00:49:43,271 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 22 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:43,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 40 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:49:43,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-08 00:49:43,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2025-03-08 00:49:43,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:43,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-03-08 00:49:43,278 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 13 [2025-03-08 00:49:43,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:43,278 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-03-08 00:49:43,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 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:49:43,278 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2025-03-08 00:49:43,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 00:49:43,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:43,279 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:43,285 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:49:43,479 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:49:43,480 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:43,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:43,480 INFO L85 PathProgramCache]: Analyzing trace with hash 381778064, now seen corresponding path program 1 times [2025-03-08 00:49:43,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:43,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083342204] [2025-03-08 00:49:43,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:49:43,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:43,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 00:49:43,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 00:49:43,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:49:43,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:43,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:43,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:43,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083342204] [2025-03-08 00:49:43,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083342204] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:43,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351070162] [2025-03-08 00:49:43,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:49:43,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:43,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:43,638 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:49:43,640 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:49:43,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 00:49:43,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 00:49:43,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:49:43,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:43,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 00:49:43,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:43,690 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:49:43,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:43,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:43,726 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:49:43,729 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:49:43,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:43,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351070162] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:43,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:43,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-08 00:49:43,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909414591] [2025-03-08 00:49:43,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:43,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 00:49:43,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:43,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 00:49:43,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:49:43,740 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 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:49:43,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:43,779 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2025-03-08 00:49:43,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:49:43,781 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 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) Word has length 13 [2025-03-08 00:49:43,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:43,781 INFO L225 Difference]: With dead ends: 32 [2025-03-08 00:49:43,781 INFO L226 Difference]: Without dead ends: 21 [2025-03-08 00:49:43,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 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:49:43,782 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 19 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:43,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 30 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:49:43,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-08 00:49:43,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2025-03-08 00:49:43,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 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:49:43,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2025-03-08 00:49:43,785 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2025-03-08 00:49:43,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:43,785 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-03-08 00:49:43,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 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:49:43,785 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2025-03-08 00:49:43,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 00:49:43,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:43,787 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:43,792 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:49:43,987 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:49:43,987 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:43,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:43,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1610116533, now seen corresponding path program 2 times [2025-03-08 00:49:43,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:43,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382082806] [2025-03-08 00:49:43,988 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:49:43,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:43,996 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-08 00:49:44,008 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 00:49:44,008 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:49:44,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:44,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:44,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:44,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382082806] [2025-03-08 00:49:44,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382082806] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:44,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942785566] [2025-03-08 00:49:44,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:49:44,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:44,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:44,065 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:49:44,067 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:49:44,101 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-08 00:49:44,113 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 00:49:44,113 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:49:44,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:44,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:49:44,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:44,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:44,199 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:44,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942785566] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:44,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:44,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-08 00:49:44,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12349136] [2025-03-08 00:49:44,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:44,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:49:44,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:44,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:49:44,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:49:44,201 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:44,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:44,287 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2025-03-08 00:49:44,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:49:44,288 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 00:49:44,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:44,288 INFO L225 Difference]: With dead ends: 27 [2025-03-08 00:49:44,288 INFO L226 Difference]: Without dead ends: 24 [2025-03-08 00:49:44,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 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:49:44,289 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:44,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 27 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:49:44,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-08 00:49:44,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2025-03-08 00:49:44,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 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:49:44,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2025-03-08 00:49:44,292 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2025-03-08 00:49:44,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:44,292 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2025-03-08 00:49:44,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:44,292 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2025-03-08 00:49:44,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 00:49:44,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:44,293 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:44,298 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:49:44,493 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:49:44,493 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:44,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:44,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1147567788, now seen corresponding path program 3 times [2025-03-08 00:49:44,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:44,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416061945] [2025-03-08 00:49:44,494 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:49:44,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:44,499 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 3 equivalence classes. [2025-03-08 00:49:44,517 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 00:49:44,517 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:49:44,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:44,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:44,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:44,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416061945] [2025-03-08 00:49:44,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416061945] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:44,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945910092] [2025-03-08 00:49:44,565 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:49:44,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:44,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:44,567 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:49:44,568 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:49:44,603 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 3 equivalence classes. [2025-03-08 00:49:44,617 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 00:49:44,617 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:49:44,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:44,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:49:44,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:44,650 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:44,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:44,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:44,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945910092] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:44,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:44,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-08 00:49:44,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48372888] [2025-03-08 00:49:44,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:44,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 00:49:44,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:44,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 00:49:44,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:49:44,679 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 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:49:44,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:44,717 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2025-03-08 00:49:44,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:49:44,717 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 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 16 [2025-03-08 00:49:44,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:44,718 INFO L225 Difference]: With dead ends: 30 [2025-03-08 00:49:44,718 INFO L226 Difference]: Without dead ends: 20 [2025-03-08 00:49:44,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:49:44,718 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:44,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 21 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:49:44,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-08 00:49:44,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-03-08 00:49:44,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:44,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2025-03-08 00:49:44,725 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16 [2025-03-08 00:49:44,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:44,725 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-03-08 00:49:44,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 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:49:44,726 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2025-03-08 00:49:44,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 00:49:44,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:44,726 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:44,732 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:49:44,926 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:49:44,927 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:44,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:44,927 INFO L85 PathProgramCache]: Analyzing trace with hash 905210606, now seen corresponding path program 4 times [2025-03-08 00:49:44,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:44,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708067735] [2025-03-08 00:49:44,927 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:49:44,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:44,938 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-08 00:49:44,946 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:49:44,946 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:49:44,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:45,300 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:45,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:45,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708067735] [2025-03-08 00:49:45,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708067735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:45,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475902287] [2025-03-08 00:49:45,301 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:49:45,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:45,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:45,304 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:49:45,306 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:49:45,339 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-08 00:49:45,353 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:49:45,353 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:49:45,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:45,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 00:49:45,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:45,361 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:49:45,426 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:49:45,558 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:49:45,570 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 00:49:45,570 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 23 treesize of output 7 [2025-03-08 00:49:45,607 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:45,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:45,756 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 00:49:45,757 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 25 treesize of output 9 [2025-03-08 00:49:45,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:45,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475902287] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:45,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:45,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2025-03-08 00:49:45,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400416738] [2025-03-08 00:49:45,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:45,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 00:49:45,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:45,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 00:49:45,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2025-03-08 00:49:45,901 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 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:49:46,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:46,615 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2025-03-08 00:49:46,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-08 00:49:46,616 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 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 17 [2025-03-08 00:49:46,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:46,617 INFO L225 Difference]: With dead ends: 45 [2025-03-08 00:49:46,617 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 00:49:46,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=282, Invalid=1524, Unknown=0, NotChecked=0, Total=1806 [2025-03-08 00:49:46,618 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 22 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:46,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 55 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:49:46,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 00:49:46,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2025-03-08 00:49:46,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 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:49:46,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2025-03-08 00:49:46,627 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 17 [2025-03-08 00:49:46,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:46,627 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2025-03-08 00:49:46,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 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:49:46,627 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2025-03-08 00:49:46,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 00:49:46,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:46,627 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:46,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 00:49:46,827 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:49:46,828 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:46,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:46,828 INFO L85 PathProgramCache]: Analyzing trace with hash 906134127, now seen corresponding path program 1 times [2025-03-08 00:49:46,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:46,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948746970] [2025-03-08 00:49:46,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:49:46,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:46,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 00:49:46,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:49:46,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:49:46,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:46,987 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:46,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:46,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948746970] [2025-03-08 00:49:46,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948746970] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:46,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441572888] [2025-03-08 00:49:46,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:49:46,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:46,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:46,990 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:49:46,991 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:49:47,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 00:49:47,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:49:47,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:49:47,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:47,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 00:49:47,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:47,056 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:49:47,092 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:47,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:47,128 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:49:47,130 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:49:47,148 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:47,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441572888] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:47,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:47,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-08 00:49:47,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783457356] [2025-03-08 00:49:47,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:47,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:49:47,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:47,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:49:47,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:49:47,150 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 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:49:47,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:47,214 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2025-03-08 00:49:47,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:49:47,214 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 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:49:47,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:47,214 INFO L225 Difference]: With dead ends: 56 [2025-03-08 00:49:47,214 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 00:49:47,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 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:49:47,215 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:47,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 55 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:49:47,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 00:49:47,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-03-08 00:49:47,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 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:49:47,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-03-08 00:49:47,220 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 17 [2025-03-08 00:49:47,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:47,220 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-03-08 00:49:47,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 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:49:47,220 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2025-03-08 00:49:47,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 00:49:47,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:47,220 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:47,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 00:49:47,421 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:49:47,421 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:47,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:47,421 INFO L85 PathProgramCache]: Analyzing trace with hash 116831380, now seen corresponding path program 5 times [2025-03-08 00:49:47,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:47,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228838955] [2025-03-08 00:49:47,422 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:49:47,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:47,428 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 3 equivalence classes. [2025-03-08 00:49:47,432 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 00:49:47,432 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-08 00:49:47,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:47,484 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:47,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:47,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228838955] [2025-03-08 00:49:47,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228838955] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:47,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057065464] [2025-03-08 00:49:47,484 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:49:47,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:47,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:47,486 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:49:47,487 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:49:47,521 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 3 equivalence classes. [2025-03-08 00:49:47,535 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 00:49:47,535 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-08 00:49:47,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:47,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:49:47,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:47,578 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:47,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:47,617 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:47,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057065464] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:47,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:47,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-03-08 00:49:47,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229642140] [2025-03-08 00:49:47,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:47,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 00:49:47,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:47,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 00:49:47,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:49:47,620 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 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:49:47,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:47,731 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2025-03-08 00:49:47,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 00:49:47,731 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 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) Word has length 18 [2025-03-08 00:49:47,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:47,732 INFO L225 Difference]: With dead ends: 47 [2025-03-08 00:49:47,733 INFO L226 Difference]: Without dead ends: 44 [2025-03-08 00:49:47,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:49:47,734 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:47,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 26 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:49:47,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-08 00:49:47,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2025-03-08 00:49:47,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 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:49:47,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-03-08 00:49:47,741 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 18 [2025-03-08 00:49:47,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:47,741 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-03-08 00:49:47,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 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:49:47,742 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2025-03-08 00:49:47,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 00:49:47,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:47,742 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:47,749 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:49:47,946 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:49:47,946 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:47,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:47,946 INFO L85 PathProgramCache]: Analyzing trace with hash -851226986, now seen corresponding path program 2 times [2025-03-08 00:49:47,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:47,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057323157] [2025-03-08 00:49:47,946 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:49:47,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:47,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-08 00:49:47,957 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 00:49:47,957 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:49:47,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:48,022 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:48,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:48,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057323157] [2025-03-08 00:49:48,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057323157] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:48,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613900580] [2025-03-08 00:49:48,023 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:49:48,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:48,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:48,025 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:49:48,027 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:49:48,064 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-08 00:49:48,078 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 00:49:48,078 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:49:48,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:48,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:49:48,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:48,140 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:48,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:48,173 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:48,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613900580] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:48,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:48,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-03-08 00:49:48,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158595243] [2025-03-08 00:49:48,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:48,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 00:49:48,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:48,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 00:49:48,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:49:48,174 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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:49:48,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:48,244 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2025-03-08 00:49:48,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:49:48,245 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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 20 [2025-03-08 00:49:48,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:48,245 INFO L225 Difference]: With dead ends: 50 [2025-03-08 00:49:48,245 INFO L226 Difference]: Without dead ends: 24 [2025-03-08 00:49:48,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:49:48,246 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:48,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 33 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:49:48,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-08 00:49:48,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-03-08 00:49:48,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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:49:48,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2025-03-08 00:49:48,249 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 20 [2025-03-08 00:49:48,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:48,249 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2025-03-08 00:49:48,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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:49:48,249 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2025-03-08 00:49:48,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 00:49:48,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:48,250 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:48,255 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:49:48,450 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:49:48,450 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:48,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:48,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1718469551, now seen corresponding path program 6 times [2025-03-08 00:49:48,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:48,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815592445] [2025-03-08 00:49:48,451 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:49:48,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:48,457 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 4 equivalence classes. [2025-03-08 00:49:48,472 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 00:49:48,472 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-08 00:49:48,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:48,821 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:48,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:48,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815592445] [2025-03-08 00:49:48,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815592445] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:48,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238505329] [2025-03-08 00:49:48,822 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:49:48,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:48,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:48,824 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:49:48,825 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:49:48,861 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 4 equivalence classes. [2025-03-08 00:49:48,875 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 00:49:48,875 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-08 00:49:48,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:48,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-08 00:49:48,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:48,883 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:49:48,996 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:49:49,100 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:49:49,250 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:49:49,267 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-03-08 00:49:49,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 10 [2025-03-08 00:49:49,335 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:49,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:49,796 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-03-08 00:49:49,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 13 [2025-03-08 00:49:49,981 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:49,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238505329] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:49,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:49,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 45 [2025-03-08 00:49:49,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62586916] [2025-03-08 00:49:49,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:49,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-08 00:49:49,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:49,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-08 00:49:49,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1776, Unknown=0, NotChecked=0, Total=1980 [2025-03-08 00:49:49,983 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 45 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:50,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:50,787 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2025-03-08 00:49:50,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 00:49:50,788 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-08 00:49:50,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:50,788 INFO L225 Difference]: With dead ends: 43 [2025-03-08 00:49:50,788 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 00:49:50,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=397, Invalid=3143, Unknown=0, NotChecked=0, Total=3540 [2025-03-08 00:49:50,789 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 11 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:50,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 88 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:49:50,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 00:49:50,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 25. [2025-03-08 00:49:50,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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:49:50,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-03-08 00:49:50,797 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 21 [2025-03-08 00:49:50,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:50,797 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-03-08 00:49:50,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:50,797 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-03-08 00:49:50,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 00:49:50,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:50,798 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:50,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 00:49:50,999 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:49:50,999 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:50,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:50,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1719393072, now seen corresponding path program 3 times [2025-03-08 00:49:50,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:51,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194533242] [2025-03-08 00:49:51,000 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:49:51,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:51,006 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes. [2025-03-08 00:49:51,020 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 21 statements. [2025-03-08 00:49:51,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:49:51,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:51,190 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:49:51,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:51,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194533242] [2025-03-08 00:49:51,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194533242] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:51,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188303120] [2025-03-08 00:49:51,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:49:51,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:51,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:51,193 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:49:51,195 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:49:51,233 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes. [2025-03-08 00:49:51,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 21 statements. [2025-03-08 00:49:51,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:49:51,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:51,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 00:49:51,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:51,255 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:49:51,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:51,307 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:49:51,336 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 00:49:51,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:51,417 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 00:49:51,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188303120] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:51,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:51,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 16 [2025-03-08 00:49:51,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250289481] [2025-03-08 00:49:51,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:51,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 00:49:51,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:51,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 00:49:51,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:49:51,419 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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:49:51,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:51,708 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2025-03-08 00:49:51,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 00:49:51,709 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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 21 [2025-03-08 00:49:51,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:51,710 INFO L225 Difference]: With dead ends: 52 [2025-03-08 00:49:51,710 INFO L226 Difference]: Without dead ends: 46 [2025-03-08 00:49:51,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=642, Unknown=0, NotChecked=0, Total=870 [2025-03-08 00:49:51,711 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 44 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:51,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 42 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:49:51,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-08 00:49:51,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2025-03-08 00:49:51,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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:49:51,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-03-08 00:49:51,718 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 21 [2025-03-08 00:49:51,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:51,718 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-03-08 00:49:51,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 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:49:51,718 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-03-08 00:49:51,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 00:49:51,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:51,718 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:51,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 00:49:51,922 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:49:51,923 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:51,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:51,923 INFO L85 PathProgramCache]: Analyzing trace with hash -965436748, now seen corresponding path program 7 times [2025-03-08 00:49:51,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:51,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791545571] [2025-03-08 00:49:51,923 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:49:51,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:51,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:49:51,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:49:51,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:49:51,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:51,998 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:51,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:51,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791545571] [2025-03-08 00:49:51,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791545571] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:51,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896661332] [2025-03-08 00:49:51,998 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:49:51,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:51,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:52,001 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:49:52,002 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:49:52,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:49:52,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:49:52,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:49:52,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:52,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 00:49:52,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:52,115 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:52,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:52,156 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:52,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896661332] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:52,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:52,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2025-03-08 00:49:52,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938756327] [2025-03-08 00:49:52,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:52,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 00:49:52,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:52,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 00:49:52,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:49:52,157 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 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:49:52,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:52,230 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2025-03-08 00:49:52,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:49:52,230 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 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:49:52,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:52,231 INFO L225 Difference]: With dead ends: 49 [2025-03-08 00:49:52,231 INFO L226 Difference]: Without dead ends: 31 [2025-03-08 00:49:52,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:49:52,231 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:52,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 33 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:49:52,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-08 00:49:52,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2025-03-08 00:49:52,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 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:49:52,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-03-08 00:49:52,252 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 24 [2025-03-08 00:49:52,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:52,252 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-03-08 00:49:52,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 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:49:52,253 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-03-08 00:49:52,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:49:52,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:52,253 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:52,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 00:49:52,456 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:49:52,456 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:52,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:52,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1056880050, now seen corresponding path program 8 times [2025-03-08 00:49:52,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:52,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461337935] [2025-03-08 00:49:52,456 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:49:52,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:52,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-08 00:49:52,489 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:49:52,489 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:49:52,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:52,918 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:52,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:52,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461337935] [2025-03-08 00:49:52,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461337935] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:52,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323789414] [2025-03-08 00:49:52,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:49:52,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:52,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:52,921 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:49:52,922 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:49:52,963 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-08 00:49:52,980 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:49:52,980 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:49:52,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:52,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-08 00:49:52,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:52,987 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:49:53,047 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:49:53,123 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:49:53,212 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:49:53,301 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:49:53,342 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:53,343 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:53,787 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:53,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323789414] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:53,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:53,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 43 [2025-03-08 00:49:53,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883703468] [2025-03-08 00:49:53,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:53,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-08 00:49:53,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:53,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-08 00:49:53,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1662, Unknown=0, NotChecked=0, Total=1806 [2025-03-08 00:49:53,789 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 43 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 43 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:49:54,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:54,346 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2025-03-08 00:49:54,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 00:49:54,346 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 43 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 25 [2025-03-08 00:49:54,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:54,348 INFO L225 Difference]: With dead ends: 47 [2025-03-08 00:49:54,348 INFO L226 Difference]: Without dead ends: 44 [2025-03-08 00:49:54,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=232, Invalid=2524, Unknown=0, NotChecked=0, Total=2756 [2025-03-08 00:49:54,349 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 5 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:54,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 95 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:49:54,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-08 00:49:54,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2025-03-08 00:49:54,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 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:49:54,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-03-08 00:49:54,356 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 25 [2025-03-08 00:49:54,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:54,356 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-03-08 00:49:54,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 43 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:49:54,356 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-03-08 00:49:54,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:49:54,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:54,356 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:54,362 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:49:54,561 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:49:54,561 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:54,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:54,561 INFO L85 PathProgramCache]: Analyzing trace with hash 685930285, now seen corresponding path program 4 times [2025-03-08 00:49:54,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:54,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452345665] [2025-03-08 00:49:54,562 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:49:54,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:54,570 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-08 00:49:54,575 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 25 statements. [2025-03-08 00:49:54,575 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:49:54,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:54,694 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:49:54,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:54,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452345665] [2025-03-08 00:49:54,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452345665] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:54,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68315445] [2025-03-08 00:49:54,695 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:49:54,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:54,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:54,697 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:49:54,699 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:49:54,742 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-08 00:49:54,751 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 25 statements. [2025-03-08 00:49:54,751 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:49:54,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:54,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 00:49:54,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:54,758 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:49:54,770 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:49:54,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:49:54,804 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:49:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 00:49:54,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:54,864 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 00:49:54,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68315445] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:54,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:54,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 13 [2025-03-08 00:49:54,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246927465] [2025-03-08 00:49:54,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:54,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 00:49:54,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:54,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 00:49:54,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:49:54,866 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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:49:55,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:55,051 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2025-03-08 00:49:55,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 00:49:55,052 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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:49:55,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:55,052 INFO L225 Difference]: With dead ends: 45 [2025-03-08 00:49:55,052 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 00:49:55,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2025-03-08 00:49:55,053 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:55,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 28 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:49:55,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 00:49:55,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2025-03-08 00:49:55,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 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:49:55,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-03-08 00:49:55,062 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 25 [2025-03-08 00:49:55,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:55,062 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-03-08 00:49:55,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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:49:55,062 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-03-08 00:49:55,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 00:49:55,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:55,063 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:55,071 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:49:55,263 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:49:55,264 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:55,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:55,264 INFO L85 PathProgramCache]: Analyzing trace with hash 403344884, now seen corresponding path program 9 times [2025-03-08 00:49:55,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:55,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73506346] [2025-03-08 00:49:55,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:49:55,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:55,269 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 5 equivalence classes. [2025-03-08 00:49:55,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 00:49:55,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 00:49:55,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:55,381 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:55,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:55,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73506346] [2025-03-08 00:49:55,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73506346] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:55,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575213360] [2025-03-08 00:49:55,382 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:49:55,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:55,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:55,384 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:49:55,385 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:49:55,431 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 5 equivalence classes. [2025-03-08 00:49:55,465 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 00:49:55,466 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 00:49:55,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:55,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:49:55,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:55,544 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:55,544 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:55,618 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:55,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575213360] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:55,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:55,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2025-03-08 00:49:55,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356086459] [2025-03-08 00:49:55,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:55,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 00:49:55,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:55,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 00:49:55,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:49:55,621 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 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:49:55,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:55,791 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2025-03-08 00:49:55,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 00:49:55,792 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 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 26 [2025-03-08 00:49:55,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:55,792 INFO L225 Difference]: With dead ends: 65 [2025-03-08 00:49:55,792 INFO L226 Difference]: Without dead ends: 62 [2025-03-08 00:49:55,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 35 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2025-03-08 00:49:55,793 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 33 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:55,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 31 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:49:55,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-08 00:49:55,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 29. [2025-03-08 00:49:55,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:49:55,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2025-03-08 00:49:55,799 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 26 [2025-03-08 00:49:55,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:55,800 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-03-08 00:49:55,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 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:49:55,800 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2025-03-08 00:49:55,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 00:49:55,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:55,801 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:55,808 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:49:56,002 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:49:56,002 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:56,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:56,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1010015157, now seen corresponding path program 10 times [2025-03-08 00:49:56,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:56,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041160032] [2025-03-08 00:49:56,003 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:49:56,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:56,009 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-08 00:49:56,015 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 00:49:56,015 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:49:56,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:56,092 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:56,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:56,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041160032] [2025-03-08 00:49:56,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041160032] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:56,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427279118] [2025-03-08 00:49:56,092 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:49:56,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:56,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:56,094 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:49:56,096 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:49:56,145 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-08 00:49:56,167 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 00:49:56,167 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:49:56,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:56,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:49:56,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:56,247 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:56,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:56,302 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:56,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427279118] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:56,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:56,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 17 [2025-03-08 00:49:56,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164544552] [2025-03-08 00:49:56,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:56,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 00:49:56,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:56,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 00:49:56,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:49:56,304 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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:49:56,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:49:56,394 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2025-03-08 00:49:56,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:49:56,395 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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 28 [2025-03-08 00:49:56,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:49:56,395 INFO L225 Difference]: With dead ends: 68 [2025-03-08 00:49:56,395 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 00:49:56,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 42 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-08 00:49:56,395 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 34 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:49:56,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 40 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:49:56,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 00:49:56,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2025-03-08 00:49:56,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 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:49:56,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2025-03-08 00:49:56,401 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 28 [2025-03-08 00:49:56,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:49:56,403 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-03-08 00:49:56,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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:49:56,403 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2025-03-08 00:49:56,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 00:49:56,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:49:56,403 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:49:56,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-08 00:49:56,603 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:49:56,603 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:49:56,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:49:56,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1152717233, now seen corresponding path program 11 times [2025-03-08 00:49:56,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:49:56,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393545254] [2025-03-08 00:49:56,604 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:49:56,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:49:56,609 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 6 equivalence classes. [2025-03-08 00:49:56,623 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:49:56,624 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-08 00:49:56,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:56,988 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 00:49:56,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:49:56,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393545254] [2025-03-08 00:49:56,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393545254] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:49:56,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515131597] [2025-03-08 00:49:56,989 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:49:56,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:49:56,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:49:56,990 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:49:56,992 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:49:57,040 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 6 equivalence classes. [2025-03-08 00:49:57,068 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:49:57,068 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-08 00:49:57,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:49:57,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-08 00:49:57,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:49:57,075 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:49:57,221 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:49:57,312 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:49:57,449 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:49:57,623 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:49:57,828 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:49:57,838 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2025-03-08 00:49:57,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 16 [2025-03-08 00:49:57,893 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:57,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:49:58,926 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2025-03-08 00:49:58,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 61 treesize of output 21 [2025-03-08 00:49:59,282 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:49:59,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515131597] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:49:59,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:49:59,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 24, 24] total 59 [2025-03-08 00:49:59,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710680640] [2025-03-08 00:49:59,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:49:59,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-03-08 00:49:59,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:49:59,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-03-08 00:49:59,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=3096, Unknown=0, NotChecked=0, Total=3422 [2025-03-08 00:49:59,284 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 59 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 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:50:07,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:07,666 INFO L93 Difference]: Finished difference Result 131 states and 168 transitions. [2025-03-08 00:50:07,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-03-08 00:50:07,667 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 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) Word has length 29 [2025-03-08 00:50:07,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:07,667 INFO L225 Difference]: With dead ends: 131 [2025-03-08 00:50:07,667 INFO L226 Difference]: Without dead ends: 117 [2025-03-08 00:50:07,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5675 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=1985, Invalid=15837, Unknown=0, NotChecked=0, Total=17822 [2025-03-08 00:50:07,671 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 69 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:07,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 131 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 00:50:07,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-08 00:50:07,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 64. [2025-03-08 00:50:07,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.253968253968254) internal successors, (79), 63 states have internal predecessors, (79), 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:07,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2025-03-08 00:50:07,691 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 29 [2025-03-08 00:50:07,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:07,691 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2025-03-08 00:50:07,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 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:50:07,691 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2025-03-08 00:50:07,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 00:50:07,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:07,691 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:07,698 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:07,893 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:07,893 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:07,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:07,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1345298704, now seen corresponding path program 5 times [2025-03-08 00:50:07,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:07,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775622878] [2025-03-08 00:50:07,893 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:50:07,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:07,901 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 6 equivalence classes. [2025-03-08 00:50:07,916 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:50:07,916 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-08 00:50:07,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 21 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 00:50:08,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:08,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775622878] [2025-03-08 00:50:08,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775622878] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:08,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094807708] [2025-03-08 00:50:08,103 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:50:08,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:08,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:08,106 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:08,106 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:08,166 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 6 equivalence classes. [2025-03-08 00:50:08,213 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:50:08,213 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-08 00:50:08,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:08,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 00:50:08,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:08,255 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:08,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:08,271 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 21 treesize of output 20 [2025-03-08 00:50:08,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:08,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:08,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:08,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:08,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2025-03-08 00:50:08,439 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 00:50:08,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:08,492 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 25 [2025-03-08 00:50:08,495 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 29 treesize of output 25 [2025-03-08 00:50:08,503 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 21 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 00:50:08,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094807708] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:08,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:08,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2025-03-08 00:50:08,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89852321] [2025-03-08 00:50:08,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:08,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 00:50:08,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:08,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 00:50:08,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2025-03-08 00:50:08,505 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 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:08,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:08,631 INFO L93 Difference]: Finished difference Result 111 states and 140 transitions. [2025-03-08 00:50:08,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 00:50:08,632 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 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 29 [2025-03-08 00:50:08,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:08,632 INFO L225 Difference]: With dead ends: 111 [2025-03-08 00:50:08,632 INFO L226 Difference]: Without dead ends: 72 [2025-03-08 00:50:08,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2025-03-08 00:50:08,633 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 20 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:08,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 69 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:08,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-08 00:50:08,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2025-03-08 00:50:08,651 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:50:08,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2025-03-08 00:50:08,652 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 29 [2025-03-08 00:50:08,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:08,652 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2025-03-08 00:50:08,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 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:08,652 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2025-03-08 00:50:08,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 00:50:08,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:08,653 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:08,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-08 00:50:08,855 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:50:08,855 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:08,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:08,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1202383761, now seen corresponding path program 6 times [2025-03-08 00:50:08,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:08,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338790619] [2025-03-08 00:50:08,856 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:50:08,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:08,863 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 7 equivalence classes. [2025-03-08 00:50:08,888 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 00:50:08,889 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-08 00:50:08,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:09,615 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:09,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:09,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338790619] [2025-03-08 00:50:09,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338790619] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:09,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797833496] [2025-03-08 00:50:09,616 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:50:09,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:09,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:09,618 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:50:09,620 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:50:09,677 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 7 equivalence classes. [2025-03-08 00:50:09,721 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 00:50:09,721 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-08 00:50:09,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:09,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 00:50:09,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:09,807 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:09,830 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:09,860 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:09,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:09,959 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 17 treesize of output 15 [2025-03-08 00:50:10,126 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:50:10,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:10,387 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:50:10,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797833496] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:10,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:10,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16, 12] total 47 [2025-03-08 00:50:10,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18235653] [2025-03-08 00:50:10,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:10,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-08 00:50:10,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:10,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-08 00:50:10,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1999, Unknown=0, NotChecked=0, Total=2162 [2025-03-08 00:50:10,388 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 47 states, 47 states have (on average 1.553191489361702) internal successors, (73), 47 states have internal predecessors, (73), 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,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:12,222 INFO L93 Difference]: Finished difference Result 210 states and 256 transitions. [2025-03-08 00:50:12,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-03-08 00:50:12,222 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.553191489361702) internal successors, (73), 47 states have internal predecessors, (73), 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 33 [2025-03-08 00:50:12,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:12,223 INFO L225 Difference]: With dead ends: 210 [2025-03-08 00:50:12,223 INFO L226 Difference]: Without dead ends: 128 [2025-03-08 00:50:12,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2502 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1180, Invalid=9740, Unknown=0, NotChecked=0, Total=10920 [2025-03-08 00:50:12,225 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 97 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:12,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 100 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:50:12,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-08 00:50:12,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 75. [2025-03-08 00:50:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.1891891891891893) internal successors, (88), 74 states have internal predecessors, (88), 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,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2025-03-08 00:50:12,247 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 33 [2025-03-08 00:50:12,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:12,247 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2025-03-08 00:50:12,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.553191489361702) internal successors, (73), 47 states have internal predecessors, (73), 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,247 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2025-03-08 00:50:12,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 00:50:12,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:12,248 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:12,254 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:50:12,448 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:50:12,448 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:12,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:12,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1071070995, now seen corresponding path program 7 times [2025-03-08 00:50:12,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:12,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096547255] [2025-03-08 00:50:12,449 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:50:12,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:12,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 00:50:12,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 00:50:12,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:12,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:12,615 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 73 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:12,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:12,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096547255] [2025-03-08 00:50:12,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096547255] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:12,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335194878] [2025-03-08 00:50:12,616 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:50:12,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:12,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:12,618 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:50:12,618 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:50:12,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 00:50:12,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 00:50:12,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:12,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:12,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 00:50:12,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 92 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:12,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:12,972 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 92 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:12,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335194878] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:12,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:12,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 28 [2025-03-08 00:50:12,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406185611] [2025-03-08 00:50:12,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:12,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 00:50:12,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:12,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 00:50:12,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2025-03-08 00:50:12,973 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand has 28 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 states have internal predecessors, (69), 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,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:13,201 INFO L93 Difference]: Finished difference Result 170 states and 204 transitions. [2025-03-08 00:50:13,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 00:50:13,202 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 states have internal predecessors, (69), 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 40 [2025-03-08 00:50:13,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:13,202 INFO L225 Difference]: With dead ends: 170 [2025-03-08 00:50:13,202 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 00:50:13,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 56 SyntacticMatches, 14 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=410, Invalid=1230, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 00:50:13,203 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 96 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:13,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 40 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:13,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 00:50:13,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 42. [2025-03-08 00:50:13,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 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,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-03-08 00:50:13,213 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 40 [2025-03-08 00:50:13,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:13,213 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-03-08 00:50:13,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 states have internal predecessors, (69), 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,213 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2025-03-08 00:50:13,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 00:50:13,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:13,214 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:13,220 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:50:13,414 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:50:13,414 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:13,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:13,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1196784301, now seen corresponding path program 8 times [2025-03-08 00:50:13,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:13,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109797256] [2025-03-08 00:50:13,415 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:50:13,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:13,422 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-08 00:50:13,440 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 00:50:13,443 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:50:13,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 21 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:13,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:13,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109797256] [2025-03-08 00:50:13,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109797256] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:13,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628827133] [2025-03-08 00:50:13,940 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:50:13,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:13,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:13,942 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:50:13,942 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:50:14,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-08 00:50:14,020 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 00:50:14,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:50:14,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:14,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-08 00:50:14,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:14,074 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:14,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:14,096 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 27 treesize of output 11 [2025-03-08 00:50:14,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:14,120 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 27 treesize of output 11 [2025-03-08 00:50:14,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:14,144 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 27 treesize of output 11 [2025-03-08 00:50:14,291 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 54 proven. 59 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:50:14,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:40,375 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 37 treesize of output 35 [2025-03-08 00:50:40,379 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 3318 treesize of output 3254 [2025-03-08 00:50:40,538 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 52 proven. 61 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:50:40,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628827133] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:40,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:40,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17, 17] total 51 [2025-03-08 00:50:40,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984010964] [2025-03-08 00:50:40,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:40,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-08 00:50:40,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:40,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-08 00:50:40,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=2268, Unknown=7, NotChecked=0, Total=2550 [2025-03-08 00:50:40,541 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 51 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 51 states have internal predecessors, (91), 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:41,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:41,136 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2025-03-08 00:50:41,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 00:50:41,137 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 51 states have internal predecessors, (91), 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:50:41,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:41,137 INFO L225 Difference]: With dead ends: 74 [2025-03-08 00:50:41,137 INFO L226 Difference]: Without dead ends: 60 [2025-03-08 00:50:41,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=494, Invalid=3281, Unknown=7, NotChecked=0, Total=3782 [2025-03-08 00:50:41,139 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 111 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:41,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 118 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:50:41,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-08 00:50:41,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 45. [2025-03-08 00:50:41,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 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:50:41,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-03-08 00:50:41,152 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 41 [2025-03-08 00:50:41,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:41,152 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-03-08 00:50:41,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 51 states have internal predecessors, (91), 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:41,152 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-03-08 00:50:41,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 00:50:41,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:41,152 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:41,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-08 00:50:41,353 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:50:41,353 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:41,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:41,353 INFO L85 PathProgramCache]: Analyzing trace with hash -862943596, now seen corresponding path program 9 times [2025-03-08 00:50:41,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:41,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074658841] [2025-03-08 00:50:41,353 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:50:41,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:41,362 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 10 equivalence classes. [2025-03-08 00:50:41,374 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 35 of 44 statements. [2025-03-08 00:50:41,374 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 00:50:41,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:41,630 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 20 proven. 88 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 00:50:41,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:41,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074658841] [2025-03-08 00:50:41,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074658841] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:41,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275881559] [2025-03-08 00:50:41,630 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:50:41,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:41,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:41,632 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:50:41,636 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:50:41,695 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 10 equivalence classes. [2025-03-08 00:50:41,745 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 35 of 44 statements. [2025-03-08 00:50:41,746 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 00:50:41,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:41,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-08 00:50:41,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:41,816 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:41,837 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:41,863 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:41,886 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:41,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:41,978 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 17 treesize of output 15 [2025-03-08 00:50:42,129 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 00:50:42,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 20 proven. 88 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 00:50:42,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275881559] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:42,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:42,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 14] total 32 [2025-03-08 00:50:42,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173581166] [2025-03-08 00:50:42,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:42,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 00:50:42,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:42,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 00:50:42,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2025-03-08 00:50:42,206 INFO L87 Difference]: Start difference. First operand 45 states and 50 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:44,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:44,158 INFO L93 Difference]: Finished difference Result 194 states and 234 transitions. [2025-03-08 00:50:44,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2025-03-08 00:50:44,158 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 44 [2025-03-08 00:50:44,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:44,159 INFO L225 Difference]: With dead ends: 194 [2025-03-08 00:50:44,159 INFO L226 Difference]: Without dead ends: 191 [2025-03-08 00:50:44,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3927 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2273, Invalid=10837, Unknown=0, NotChecked=0, Total=13110 [2025-03-08 00:50:44,161 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 131 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:44,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 128 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:50:44,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-08 00:50:44,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 81. [2025-03-08 00:50:44,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.175) internal successors, (94), 80 states have internal predecessors, (94), 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:44,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2025-03-08 00:50:44,185 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 44 [2025-03-08 00:50:44,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:44,185 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2025-03-08 00:50:44,186 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:44,186 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2025-03-08 00:50:44,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 00:50:44,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:44,186 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:44,193 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:50:44,386 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:50:44,387 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:44,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:44,387 INFO L85 PathProgramCache]: Analyzing trace with hash -13036331, now seen corresponding path program 10 times [2025-03-08 00:50:44,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:44,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066473829] [2025-03-08 00:50:44,387 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:50:44,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:44,396 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 48 statements into 2 equivalence classes. [2025-03-08 00:50:44,402 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 44 of 48 statements. [2025-03-08 00:50:44,403 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:50:44,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:44,721 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 25 proven. 125 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 00:50:44,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:44,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066473829] [2025-03-08 00:50:44,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066473829] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:44,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273319907] [2025-03-08 00:50:44,722 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:50:44,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:44,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:44,724 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:50:44,726 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:50:44,793 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 48 statements into 2 equivalence classes. [2025-03-08 00:50:44,810 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 44 of 48 statements. [2025-03-08 00:50:44,810 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:50:44,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:44,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-08 00:50:44,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:44,816 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:50:44,820 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 38 treesize of output 16 [2025-03-08 00:50:44,825 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 38 treesize of output 16 [2025-03-08 00:50:44,828 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 38 treesize of output 16 [2025-03-08 00:50:44,833 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:50:45,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:45,006 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 22 treesize of output 15 [2025-03-08 00:50:45,168 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 25 proven. 155 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:50:45,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:45,463 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 25 proven. 155 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:50:45,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273319907] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:45,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:45,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21, 21] total 42 [2025-03-08 00:50:45,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648660293] [2025-03-08 00:50:45,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:45,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-08 00:50:45,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:45,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-08 00:50:45,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1499, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 00:50:45,464 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 42 states have internal predecessors, (88), 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,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:51:03,361 INFO L93 Difference]: Finished difference Result 620 states and 761 transitions. [2025-03-08 00:51:03,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 393 states. [2025-03-08 00:51:03,362 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 42 states have internal predecessors, (88), 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 48 [2025-03-08 00:51:03,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:51:03,363 INFO L225 Difference]: With dead ends: 620 [2025-03-08 00:51:03,363 INFO L226 Difference]: Without dead ends: 617 [2025-03-08 00:51:03,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 428 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75819 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=20303, Invalid=164167, Unknown=0, NotChecked=0, Total=184470 [2025-03-08 00:51:03,371 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 108 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 3942 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 3996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 3942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 00:51:03,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 82 Invalid, 3996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 3942 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 00:51:03,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2025-03-08 00:51:03,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 78. [2025-03-08 00:51:03,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 77 states have internal predecessors, (90), 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,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2025-03-08 00:51:03,402 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 48 [2025-03-08 00:51:03,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:51:03,402 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2025-03-08 00:51:03,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 42 states have internal predecessors, (88), 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,402 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2025-03-08 00:51:03,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 00:51:03,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:51:03,403 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:51:03,408 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:03,603 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:03,603 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:51:03,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:51:03,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1699942450, now seen corresponding path program 11 times [2025-03-08 00:51:03,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:51:03,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268528139] [2025-03-08 00:51:03,603 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:51:03,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:51:03,614 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 12 equivalence classes. [2025-03-08 00:51:03,623 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 00:51:03,623 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-03-08 00:51:03,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:03,870 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 176 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:51:03,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:51:03,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268528139] [2025-03-08 00:51:03,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268528139] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:51:03,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585272463] [2025-03-08 00:51:03,871 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:51:03,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:51:03,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:51:03,873 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:03,894 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:03,968 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 12 equivalence classes. [2025-03-08 00:51:04,823 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 00:51:04,823 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-03-08 00:51:04,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:04,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 00:51:04,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:51:05,096 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 176 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:51:05,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:51:05,283 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 176 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:51:05,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585272463] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:51:05,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:51:05,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 36 [2025-03-08 00:51:05,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296730542] [2025-03-08 00:51:05,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:51:05,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-08 00:51:05,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:51:05,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-08 00:51:05,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=938, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 00:51:05,285 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand has 36 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 36 states have internal predecessors, (92), 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:05,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:51:05,871 INFO L93 Difference]: Finished difference Result 305 states and 372 transitions. [2025-03-08 00:51:05,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-08 00:51:05,875 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 36 states have internal predecessors, (92), 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 51 [2025-03-08 00:51:05,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:51:05,875 INFO L225 Difference]: With dead ends: 305 [2025-03-08 00:51:05,875 INFO L226 Difference]: Without dead ends: 124 [2025-03-08 00:51:05,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 71 SyntacticMatches, 18 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1341 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=926, Invalid=3364, Unknown=0, NotChecked=0, Total=4290 [2025-03-08 00:51:05,876 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 225 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:51:05,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 45 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:51:05,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-08 00:51:05,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 54. [2025-03-08 00:51:05,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 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:05,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2025-03-08 00:51:05,897 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 51 [2025-03-08 00:51:05,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:51:05,897 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2025-03-08 00:51:05,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 36 states have internal predecessors, (92), 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:05,897 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2025-03-08 00:51:05,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 00:51:05,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:51:05,898 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:51:05,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-08 00:51:06,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:51:06,098 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:51:06,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:51:06,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1841761138, now seen corresponding path program 12 times [2025-03-08 00:51:06,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:51:06,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416219913] [2025-03-08 00:51:06,099 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:51:06,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:51:06,107 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 53 statements into 12 equivalence classes. [2025-03-08 00:51:06,138 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 00:51:06,138 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2025-03-08 00:51:06,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:07,827 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:51:07,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:51:07,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416219913] [2025-03-08 00:51:07,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416219913] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:51:07,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677151673] [2025-03-08 00:51:07,827 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:51:07,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:51:07,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:51:07,829 INFO L229 MonitoredProcess]: Starting monitored process 25 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:07,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-08 00:51:07,899 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 53 statements into 12 equivalence classes. [2025-03-08 00:51:09,177 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 00:51:09,177 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2025-03-08 00:51:09,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:09,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-08 00:51:09,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:51:09,384 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:09,433 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2025-03-08 00:51:09,433 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 15 [2025-03-08 00:51:09,506 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2025-03-08 00:51:09,506 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 19 [2025-03-08 00:51:09,578 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-03-08 00:51:09,578 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 35 treesize of output 19 [2025-03-08 00:51:09,639 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-03-08 00:51:09,639 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 35 treesize of output 19 [2025-03-08 00:51:09,706 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2025-03-08 00:51:09,706 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 19 [2025-03-08 00:51:10,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:51:10,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2025-03-08 00:51:10,557 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 31 proven. 211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:51:10,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:51:11,798 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 34 treesize of output 30 [2025-03-08 00:51:11,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:51:11,800 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 33 treesize of output 25 [2025-03-08 00:51:12,081 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:51:12,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677151673] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:51:12,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:51:12,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 29, 31] total 94 [2025-03-08 00:51:12,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743878891] [2025-03-08 00:51:12,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:51:12,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2025-03-08 00:51:12,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:51:12,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2025-03-08 00:51:12,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=751, Invalid=7991, Unknown=0, NotChecked=0, Total=8742 [2025-03-08 00:51:12,082 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 94 states, 94 states have (on average 1.5425531914893618) internal successors, (145), 94 states have internal predecessors, (145), 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:14,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:51:14,327 INFO L93 Difference]: Finished difference Result 118 states and 141 transitions. [2025-03-08 00:51:14,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-08 00:51:14,328 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 94 states have (on average 1.5425531914893618) internal successors, (145), 94 states have internal predecessors, (145), 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 53 [2025-03-08 00:51:14,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:51:14,329 INFO L225 Difference]: With dead ends: 118 [2025-03-08 00:51:14,329 INFO L226 Difference]: Without dead ends: 58 [2025-03-08 00:51:14,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3477 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1696, Invalid=15074, Unknown=0, NotChecked=0, Total=16770 [2025-03-08 00:51:14,330 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 152 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 1901 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 1956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 00:51:14,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 145 Invalid, 1956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1901 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 00:51:14,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-08 00:51:14,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2025-03-08 00:51:14,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 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:14,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2025-03-08 00:51:14,350 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 53 [2025-03-08 00:51:14,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:51:14,350 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2025-03-08 00:51:14,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 1.5425531914893618) internal successors, (145), 94 states have internal predecessors, (145), 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:14,350 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2025-03-08 00:51:14,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 00:51:14,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:51:14,350 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:51:14,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-08 00:51:14,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-08 00:51:14,551 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:51:14,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:51:14,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1234106733, now seen corresponding path program 13 times [2025-03-08 00:51:14,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:51:14,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185276694] [2025-03-08 00:51:14,551 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:51:14,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:51:14,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 00:51:14,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 00:51:14,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:51:14,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:14,847 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 179 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:51:14,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:51:14,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185276694] [2025-03-08 00:51:14,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185276694] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:51:14,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798594322] [2025-03-08 00:51:14,847 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:51:14,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:51:14,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:51:14,849 INFO L229 MonitoredProcess]: Starting monitored process 26 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:14,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-08 00:51:14,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 00:51:14,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 00:51:14,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:51:14,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:14,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 00:51:14,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:51:15,204 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 210 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:51:15,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:51:15,392 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 210 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:51:15,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798594322] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:51:15,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:51:15,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 40 [2025-03-08 00:51:15,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501241146] [2025-03-08 00:51:15,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:51:15,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-08 00:51:15,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:51:15,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-08 00:51:15,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=1180, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 00:51:15,393 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 40 states, 40 states have (on average 2.425) internal successors, (97), 40 states have internal predecessors, (97), 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:15,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:51:15,693 INFO L93 Difference]: Finished difference Result 225 states and 275 transitions. [2025-03-08 00:51:15,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 00:51:15,693 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.425) internal successors, (97), 40 states have internal predecessors, (97), 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 56 [2025-03-08 00:51:15,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:51:15,694 INFO L225 Difference]: With dead ends: 225 [2025-03-08 00:51:15,694 INFO L226 Difference]: Without dead ends: 128 [2025-03-08 00:51:15,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 76 SyntacticMatches, 22 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=622, Invalid=1928, Unknown=0, NotChecked=0, Total=2550 [2025-03-08 00:51:15,695 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 122 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:51:15,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 38 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:51:15,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-08 00:51:15,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 58. [2025-03-08 00:51:15,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 57 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:51:15,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2025-03-08 00:51:15,716 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 56 [2025-03-08 00:51:15,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:51:15,716 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2025-03-08 00:51:15,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.425) internal successors, (97), 40 states have internal predecessors, (97), 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:15,716 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2025-03-08 00:51:15,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 00:51:15,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:51:15,716 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:51:15,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-08 00:51:15,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-08 00:51:15,917 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:51:15,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:51:15,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1370960339, now seen corresponding path program 14 times [2025-03-08 00:51:15,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:51:15,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860023581] [2025-03-08 00:51:15,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:51:15,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:51:15,925 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-03-08 00:51:15,936 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 00:51:15,936 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:51:15,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat