./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s12if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/s12if.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 82bfc5dbe63d3250f02def4ff730c5e861bce4a7ef8a101c197bc29dbc0e3123 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:39:01,490 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:39:01,542 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:39:01,546 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:39:01,546 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:39:01,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:39:01,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:39:01,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:39:01,570 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:39:01,570 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:39:01,570 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:39:01,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:39:01,571 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:39:01,571 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:39:01,572 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:39:01,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:39:01,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:39:01,572 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:39:01,573 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:39:01,573 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:39:01,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:39:01,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:39:01,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:39:01,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:39:01,573 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:39:01,573 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:39:01,573 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:39:01,573 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:39:01,573 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:39:01,573 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:39:01,573 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:39:01,573 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:39:01,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:39:01,574 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:39:01,574 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:39:01,574 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:39:01,574 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:39:01,574 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:39:01,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:39:01,574 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:39:01,574 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:39:01,574 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:39:01,574 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:39:01,574 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 -> 82bfc5dbe63d3250f02def4ff730c5e861bce4a7ef8a101c197bc29dbc0e3123 [2025-03-03 09:39:01,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:39:01,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:39:01,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:39:01,799 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:39:01,799 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:39:01,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s12if.c [2025-03-03 09:39:02,939 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97e6297ae/2d01616308f64de289b1a143bf491aed/FLAG773272dcd [2025-03-03 09:39:03,150 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:39:03,151 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s12if.c [2025-03-03 09:39:03,160 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97e6297ae/2d01616308f64de289b1a143bf491aed/FLAG773272dcd [2025-03-03 09:39:03,493 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97e6297ae/2d01616308f64de289b1a143bf491aed [2025-03-03 09:39:03,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:39:03,497 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:39:03,498 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:39:03,498 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:39:03,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:39:03,502 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:39:03" (1/1) ... [2025-03-03 09:39:03,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a72b5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:39:03, skipping insertion in model container [2025-03-03 09:39:03,503 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:39:03" (1/1) ... [2025-03-03 09:39:03,514 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:39:03,597 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/s12if.c[588,601] [2025-03-03 09:39:03,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:39:03,621 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:39:03,627 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/s12if.c[588,601] [2025-03-03 09:39:03,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:39:03,641 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:39:03,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:39:03 WrapperNode [2025-03-03 09:39:03,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:39:03,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:39:03,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:39:03,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:39:03,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:39:03" (1/1) ... [2025-03-03 09:39:03,655 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:39:03" (1/1) ... [2025-03-03 09:39:03,669 INFO L138 Inliner]: procedures = 17, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2025-03-03 09:39:03,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:39:03,672 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:39:03,672 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:39:03,672 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:39:03,678 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:39:03" (1/1) ... [2025-03-03 09:39:03,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:39:03" (1/1) ... [2025-03-03 09:39:03,680 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:39:03" (1/1) ... [2025-03-03 09:39:03,691 INFO L175 MemorySlicer]: Split 25 memory accesses to 4 slices as follows [2, 6, 8, 9]. 36 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 0, 8, 0]. The 6 writes are split as follows [0, 3, 0, 3]. [2025-03-03 09:39:03,694 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:39:03" (1/1) ... [2025-03-03 09:39:03,695 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:39:03" (1/1) ... [2025-03-03 09:39:03,699 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:39:03" (1/1) ... [2025-03-03 09:39:03,703 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:39:03" (1/1) ... [2025-03-03 09:39:03,703 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:39:03" (1/1) ... [2025-03-03 09:39:03,704 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:39:03" (1/1) ... [2025-03-03 09:39:03,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:39:03,709 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:39:03,712 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:39:03,713 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:39:03,714 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:39:03" (1/1) ... [2025-03-03 09:39:03,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:39:03,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:03,739 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 09:39:03,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 09:39:03,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:39:03,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:39:03,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:39:03,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 09:39:03,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 09:39:03,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:39:03,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:39:03,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:39:03,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 09:39:03,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 09:39:03,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-03 09:39:03,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:39:03,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:39:03,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:39:03,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:39:03,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 09:39:03,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 09:39:03,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:39:03,827 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:39:03,828 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:39:03,964 INFO L1325 $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-03 09:39:03,971 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 09:39:03,972 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:39:03,977 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:39:03,977 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:39:03,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:39:03 BoogieIcfgContainer [2025-03-03 09:39:03,978 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:39:03,981 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:39:03,984 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:39:03,987 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:39:03,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:39:03" (1/3) ... [2025-03-03 09:39:03,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3163aa55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:39:03, skipping insertion in model container [2025-03-03 09:39:03,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:39:03" (2/3) ... [2025-03-03 09:39:03,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3163aa55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:39:03, skipping insertion in model container [2025-03-03 09:39:03,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:39:03" (3/3) ... [2025-03-03 09:39:03,990 INFO L128 eAbstractionObserver]: Analyzing ICFG s12if.c [2025-03-03 09:39:04,001 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:39:04,002 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s12if.c that has 1 procedures, 19 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-03 09:39:04,034 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:39:04,043 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;@6b9566f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:39:04,043 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:39:04,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:04,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 09:39:04,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:04,052 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:04,052 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:04,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:04,056 INFO L85 PathProgramCache]: Analyzing trace with hash -411444654, now seen corresponding path program 1 times [2025-03-03 09:39:04,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:04,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768402984] [2025-03-03 09:39:04,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:39:04,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:04,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 09:39:04,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 09:39:04,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:39:04,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:04,175 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-03 09:39:04,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:04,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768402984] [2025-03-03 09:39:04,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768402984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:39:04,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:39:04,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:39:04,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281518170] [2025-03-03 09:39:04,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:39:04,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 09:39:04,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:04,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 09:39:04,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:39:04,201 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:04,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:04,211 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2025-03-03 09:39:04,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 09:39:04,213 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-03 09:39:04,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:04,218 INFO L225 Difference]: With dead ends: 34 [2025-03-03 09:39:04,218 INFO L226 Difference]: Without dead ends: 15 [2025-03-03 09:39:04,221 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-03 09:39:04,225 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:04,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:39:04,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-03 09:39:04,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-03 09:39:04,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:04,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2025-03-03 09:39:04,250 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 10 [2025-03-03 09:39:04,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:04,250 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-03-03 09:39:04,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:04,250 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2025-03-03 09:39:04,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 09:39:04,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:04,250 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:04,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:39:04,251 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:04,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:04,251 INFO L85 PathProgramCache]: Analyzing trace with hash 476059027, now seen corresponding path program 1 times [2025-03-03 09:39:04,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:04,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094923036] [2025-03-03 09:39:04,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:39:04,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:04,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 09:39:04,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 09:39:04,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:39:04,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:04,414 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-03 09:39:04,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:04,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094923036] [2025-03-03 09:39:04,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094923036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:39:04,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:39:04,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:39:04,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980957649] [2025-03-03 09:39:04,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:39:04,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:39:04,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:04,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:39:04,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:39:04,415 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:04,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:04,473 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2025-03-03 09:39:04,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:39:04,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-03 09:39:04,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:04,474 INFO L225 Difference]: With dead ends: 31 [2025-03-03 09:39:04,474 INFO L226 Difference]: Without dead ends: 22 [2025-03-03 09:39:04,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:39:04,475 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 29 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:04,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 9 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:39:04,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-03 09:39:04,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2025-03-03 09:39:04,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:04,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-03 09:39:04,482 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2025-03-03 09:39:04,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:04,482 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-03 09:39:04,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:04,482 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-03 09:39:04,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 09:39:04,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:04,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:04,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:39:04,482 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:04,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:04,483 INFO L85 PathProgramCache]: Analyzing trace with hash 330064146, now seen corresponding path program 1 times [2025-03-03 09:39:04,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:04,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127760334] [2025-03-03 09:39:04,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:39:04,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:04,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 09:39:04,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:39:04,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:39:04,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:05,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:39:05,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:05,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127760334] [2025-03-03 09:39:05,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127760334] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:05,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61032020] [2025-03-03 09:39:05,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:39:05,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:05,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:05,014 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:39:05,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 09:39:05,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 09:39:05,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:39:05,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:39:05,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:05,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 09:39:05,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:05,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:39:05,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-03 09:39:05,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-03 09:39:05,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:39:05,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:05,403 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-03 09:39:05,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-03 09:39:05,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:39:05,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61032020] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:05,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:05,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2025-03-03 09:39:05,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965077388] [2025-03-03 09:39:05,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:05,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 09:39:05,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:05,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 09:39:05,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2025-03-03 09:39:05,428 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:06,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:06,440 INFO L93 Difference]: Finished difference Result 125 states and 174 transitions. [2025-03-03 09:39:06,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-03 09:39:06,440 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-03 09:39:06,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:06,442 INFO L225 Difference]: With dead ends: 125 [2025-03-03 09:39:06,442 INFO L226 Difference]: Without dead ends: 115 [2025-03-03 09:39:06,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=677, Invalid=2863, Unknown=0, NotChecked=0, Total=3540 [2025-03-03 09:39:06,444 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 221 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:06,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 66 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:39:06,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-03 09:39:06,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 46. [2025-03-03 09:39:06,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 45 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:06,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2025-03-03 09:39:06,451 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 17 [2025-03-03 09:39:06,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:06,451 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2025-03-03 09:39:06,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:06,452 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2025-03-03 09:39:06,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 09:39:06,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:06,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:06,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 09:39:06,656 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-03 09:39:06,656 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:06,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:06,657 INFO L85 PathProgramCache]: Analyzing trace with hash 330987667, now seen corresponding path program 1 times [2025-03-03 09:39:06,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:06,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022664195] [2025-03-03 09:39:06,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:39:06,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:06,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 09:39:06,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:39:06,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:39:06,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:06,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:39:06,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:06,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022664195] [2025-03-03 09:39:06,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022664195] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:06,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037043003] [2025-03-03 09:39:06,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:39:06,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:06,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:06,818 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:39:06,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 09:39:06,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 09:39:06,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:39:06,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:39:06,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:06,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 09:39:06,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:06,878 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-03 09:39:06,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:39:06,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:06,907 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-03 09:39:06,909 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-03 09:39:06,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:39:06,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037043003] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:06,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:06,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 09:39:06,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032051040] [2025-03-03 09:39:06,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:06,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 09:39:06,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:06,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 09:39:06,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:39:06,917 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:06,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:06,982 INFO L93 Difference]: Finished difference Result 72 states and 100 transitions. [2025-03-03 09:39:06,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:39:06,984 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-03 09:39:06,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:06,985 INFO L225 Difference]: With dead ends: 72 [2025-03-03 09:39:06,985 INFO L226 Difference]: Without dead ends: 38 [2025-03-03 09:39:06,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:39:06,985 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 7 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:06,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 54 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:39:06,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-03 09:39:06,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2025-03-03 09:39:06,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:06,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2025-03-03 09:39:06,994 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 17 [2025-03-03 09:39:06,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:06,994 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2025-03-03 09:39:06,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:06,994 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2025-03-03 09:39:06,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 09:39:06,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:06,994 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:07,001 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-03 09:39:07,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-03 09:39:07,195 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:07,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:07,196 INFO L85 PathProgramCache]: Analyzing trace with hash 2138442130, now seen corresponding path program 1 times [2025-03-03 09:39:07,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:07,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435823977] [2025-03-03 09:39:07,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:39:07,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:07,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 09:39:07,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:39:07,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:39:07,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:07,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:39:07,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:07,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435823977] [2025-03-03 09:39:07,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435823977] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:07,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818894591] [2025-03-03 09:39:07,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:39:07,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:07,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:07,397 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:39:07,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 09:39:07,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 09:39:07,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:39:07,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:39:07,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:07,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 09:39:07,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:07,487 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-03 09:39:07,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:39:07,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:07,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2025-03-03 09:39:07,546 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-03 09:39:07,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 16 [2025-03-03 09:39:07,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:39:07,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818894591] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:07,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:07,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 15 [2025-03-03 09:39:07,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057082823] [2025-03-03 09:39:07,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:07,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 09:39:07,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:07,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 09:39:07,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:39:07,559 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:07,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:07,676 INFO L93 Difference]: Finished difference Result 75 states and 100 transitions. [2025-03-03 09:39:07,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:39:07,677 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-03 09:39:07,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:07,677 INFO L225 Difference]: With dead ends: 75 [2025-03-03 09:39:07,677 INFO L226 Difference]: Without dead ends: 64 [2025-03-03 09:39:07,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:39:07,678 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 44 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:07,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 54 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:39:07,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-03 09:39:07,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 40. [2025-03-03 09:39:07,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:07,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2025-03-03 09:39:07,685 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 17 [2025-03-03 09:39:07,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:07,685 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 53 transitions. [2025-03-03 09:39:07,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:07,685 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2025-03-03 09:39:07,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 09:39:07,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:07,686 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:07,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 09:39:07,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:07,886 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:07,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:07,886 INFO L85 PathProgramCache]: Analyzing trace with hash 658744914, now seen corresponding path program 1 times [2025-03-03 09:39:07,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:07,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932058836] [2025-03-03 09:39:07,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:39:07,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:07,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 09:39:07,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 09:39:07,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:39:07,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:07,958 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:39:07,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:07,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932058836] [2025-03-03 09:39:07,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932058836] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:07,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733113011] [2025-03-03 09:39:07,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:39:07,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:07,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:07,961 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:39:07,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 09:39:07,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 09:39:08,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 09:39:08,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:39:08,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:08,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:39:08,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:08,066 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:39:08,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:08,101 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:39:08,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733113011] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:08,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:08,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-03 09:39:08,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048481121] [2025-03-03 09:39:08,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:08,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 09:39:08,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:08,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 09:39:08,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:39:08,103 INFO L87 Difference]: Start difference. First operand 40 states and 53 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:08,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:08,232 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2025-03-03 09:39:08,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:39:08,233 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-03 09:39:08,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:08,234 INFO L225 Difference]: With dead ends: 73 [2025-03-03 09:39:08,234 INFO L226 Difference]: Without dead ends: 65 [2025-03-03 09:39:08,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:39:08,235 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 47 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:08,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 24 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:39:08,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-03 09:39:08,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 45. [2025-03-03 09:39:08,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 44 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:08,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2025-03-03 09:39:08,247 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 18 [2025-03-03 09:39:08,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:08,247 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2025-03-03 09:39:08,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:08,248 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2025-03-03 09:39:08,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 09:39:08,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:08,249 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:08,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 09:39:08,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:08,450 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:08,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:08,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1750087954, now seen corresponding path program 2 times [2025-03-03 09:39:08,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:08,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427855262] [2025-03-03 09:39:08,450 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:39:08,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:08,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-03 09:39:08,465 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 09:39:08,465 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:39:08,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:08,512 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:39:08,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:08,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427855262] [2025-03-03 09:39:08,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427855262] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:08,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758019417] [2025-03-03 09:39:08,513 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:39:08,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:08,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:08,514 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:39:08,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 09:39:08,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-03 09:39:08,560 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 09:39:08,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:39:08,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:08,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:39:08,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:08,594 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:39:08,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:08,623 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:39:08,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758019417] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:08,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:08,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-03 09:39:08,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085295063] [2025-03-03 09:39:08,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:08,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 09:39:08,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:08,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 09:39:08,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:39:08,625 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:08,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:08,696 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2025-03-03 09:39:08,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:39:08,696 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-03 09:39:08,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:08,697 INFO L225 Difference]: With dead ends: 66 [2025-03-03 09:39:08,697 INFO L226 Difference]: Without dead ends: 35 [2025-03-03 09:39:08,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:39:08,697 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 25 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:08,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 19 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:39:08,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-03 09:39:08,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2025-03-03 09:39:08,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2025-03-03 09:39:08,703 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 20 [2025-03-03 09:39:08,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:08,703 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2025-03-03 09:39:08,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:08,703 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2025-03-03 09:39:08,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 09:39:08,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:08,703 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:08,710 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-03 09:39:08,904 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-03 09:39:08,904 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:08,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:08,904 INFO L85 PathProgramCache]: Analyzing trace with hash 2079589618, now seen corresponding path program 1 times [2025-03-03 09:39:08,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:08,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178698460] [2025-03-03 09:39:08,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:39:08,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:08,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 09:39:08,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:39:08,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:39:08,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:09,299 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:39:09,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:09,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178698460] [2025-03-03 09:39:09,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178698460] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:09,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410658443] [2025-03-03 09:39:09,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:39:09,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:09,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:09,303 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-03 09:39:09,303 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-03 09:39:09,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 09:39:09,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:39:09,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:39:09,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:09,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-03 09:39:09,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:09,386 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-03 09:39:09,434 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-03 09:39:09,466 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-03 09:39:09,548 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:39:09,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:09,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-03 09:39:09,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-03 09:39:09,752 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:39:09,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410658443] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:09,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:09,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 32 [2025-03-03 09:39:09,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877941246] [2025-03-03 09:39:09,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:09,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 09:39:09,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:09,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 09:39:09,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2025-03-03 09:39:09,754 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 32 states, 32 states have (on average 1.78125) internal successors, (57), 32 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:12,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:12,798 INFO L93 Difference]: Finished difference Result 269 states and 387 transitions. [2025-03-03 09:39:12,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2025-03-03 09:39:12,798 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.78125) internal successors, (57), 32 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-03 09:39:12,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:12,800 INFO L225 Difference]: With dead ends: 269 [2025-03-03 09:39:12,800 INFO L226 Difference]: Without dead ends: 258 [2025-03-03 09:39:12,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6675 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2173, Invalid=17009, Unknown=0, NotChecked=0, Total=19182 [2025-03-03 09:39:12,806 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 327 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:12,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 108 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 09:39:12,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-03 09:39:12,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 95. [2025-03-03 09:39:12,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.425531914893617) internal successors, (134), 94 states have internal predecessors, (134), 0 states have call successors, (0), 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-03 09:39:12,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 134 transitions. [2025-03-03 09:39:12,821 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 134 transitions. Word has length 24 [2025-03-03 09:39:12,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:12,821 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 134 transitions. [2025-03-03 09:39:12,821 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-03 09:39:12,821 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 134 transitions. [2025-03-03 09:39:12,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 09:39:12,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:12,822 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:12,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 09:39:13,024 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-03 09:39:13,024 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:13,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:13,025 INFO L85 PathProgramCache]: Analyzing trace with hash 2080513139, now seen corresponding path program 1 times [2025-03-03 09:39:13,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:13,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074304431] [2025-03-03 09:39:13,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:39:13,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:13,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 09:39:13,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:39:13,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:39:13,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:13,248 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:39:13,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:13,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074304431] [2025-03-03 09:39:13,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074304431] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:13,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947948713] [2025-03-03 09:39:13,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:39:13,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:13,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:13,251 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-03 09:39:13,252 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-03 09:39:13,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 09:39:13,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:39:13,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:39:13,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:13,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 09:39:13,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:13,320 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-03 09:39:13,342 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-03 09:39:13,353 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:39:13,353 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:13,384 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-03 09:39:13,386 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-03 09:39:13,401 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:39:13,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947948713] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:13,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:13,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-03 09:39:13,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853664251] [2025-03-03 09:39:13,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:13,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 09:39:13,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:13,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 09:39:13,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:39:13,402 INFO L87 Difference]: Start difference. First operand 95 states and 134 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:13,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:13,502 INFO L93 Difference]: Finished difference Result 134 states and 187 transitions. [2025-03-03 09:39:13,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:39:13,503 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-03 09:39:13,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:13,503 INFO L225 Difference]: With dead ends: 134 [2025-03-03 09:39:13,503 INFO L226 Difference]: Without dead ends: 68 [2025-03-03 09:39:13,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:39:13,504 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:13,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 64 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:39:13,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-03 09:39:13,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2025-03-03 09:39:13,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 56 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:13,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2025-03-03 09:39:13,515 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 24 [2025-03-03 09:39:13,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:13,515 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2025-03-03 09:39:13,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:13,515 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2025-03-03 09:39:13,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 09:39:13,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:13,516 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:13,522 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-03 09:39:13,720 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-03 09:39:13,720 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:13,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:13,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1951430420, now seen corresponding path program 1 times [2025-03-03 09:39:13,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:13,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838307690] [2025-03-03 09:39:13,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:39:13,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:13,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 09:39:13,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:39:13,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:39:13,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:13,921 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:39:13,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:13,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838307690] [2025-03-03 09:39:13,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838307690] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:13,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613099324] [2025-03-03 09:39:13,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:39:13,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:13,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:13,923 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-03 09:39:13,925 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-03 09:39:13,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 09:39:13,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:39:13,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:39:13,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:13,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 09:39:13,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:14,009 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-03 09:39:14,037 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:39:14,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:14,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-03 09:39:14,086 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-03 09:39:14,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2025-03-03 09:39:14,104 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:39:14,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613099324] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:14,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:14,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 18 [2025-03-03 09:39:14,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733617732] [2025-03-03 09:39:14,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:14,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 09:39:14,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:14,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 09:39:14,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:39:14,105 INFO L87 Difference]: Start difference. First operand 57 states and 74 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:14,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:14,235 INFO L93 Difference]: Finished difference Result 96 states and 124 transitions. [2025-03-03 09:39:14,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 09:39:14,235 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-03 09:39:14,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:14,236 INFO L225 Difference]: With dead ends: 96 [2025-03-03 09:39:14,236 INFO L226 Difference]: Without dead ends: 90 [2025-03-03 09:39:14,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2025-03-03 09:39:14,236 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 68 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:14,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 56 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:39:14,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-03 09:39:14,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 63. [2025-03-03 09:39:14,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 62 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:14,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2025-03-03 09:39:14,249 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 24 [2025-03-03 09:39:14,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:14,249 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2025-03-03 09:39:14,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:14,249 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2025-03-03 09:39:14,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 09:39:14,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:14,250 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:14,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-03 09:39:14,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-03 09:39:14,450 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:14,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:14,451 INFO L85 PathProgramCache]: Analyzing trace with hash 62951474, now seen corresponding path program 3 times [2025-03-03 09:39:14,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:14,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165276085] [2025-03-03 09:39:14,451 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:39:14,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:14,458 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-03-03 09:39:14,468 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:39:14,468 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:39:14,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:14,541 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:39:14,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:14,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165276085] [2025-03-03 09:39:14,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165276085] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:14,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007100948] [2025-03-03 09:39:14,542 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:39:14,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:14,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:14,544 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-03 09:39:14,545 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-03 09:39:14,585 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-03-03 09:39:14,605 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:39:14,605 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:39:14,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:14,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:39:14,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:14,657 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:39:14,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:14,701 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:39:14,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007100948] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:14,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:14,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-03 09:39:14,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271796284] [2025-03-03 09:39:14,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:14,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 09:39:14,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:14,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 09:39:14,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:39:14,703 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:14,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:14,851 INFO L93 Difference]: Finished difference Result 108 states and 138 transitions. [2025-03-03 09:39:14,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:39:14,852 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-03 09:39:14,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:14,853 INFO L225 Difference]: With dead ends: 108 [2025-03-03 09:39:14,853 INFO L226 Difference]: Without dead ends: 97 [2025-03-03 09:39:14,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:39:14,853 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 63 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:14,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 28 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:39:14,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-03 09:39:14,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 66. [2025-03-03 09:39:14,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:14,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2025-03-03 09:39:14,862 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 85 transitions. Word has length 25 [2025-03-03 09:39:14,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:14,862 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 85 transitions. [2025-03-03 09:39:14,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:14,862 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2025-03-03 09:39:14,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 09:39:14,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:14,864 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:14,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 09:39:15,068 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-03 09:39:15,069 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:15,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:15,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1056818256, now seen corresponding path program 4 times [2025-03-03 09:39:15,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:15,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130966064] [2025-03-03 09:39:15,070 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:39:15,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:15,077 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-03 09:39:15,080 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 23 of 27 statements. [2025-03-03 09:39:15,081 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:39:15,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:15,123 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:39:15,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:15,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130966064] [2025-03-03 09:39:15,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130966064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:15,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973648656] [2025-03-03 09:39:15,124 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:39:15,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:15,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:15,126 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-03 09:39:15,131 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-03 09:39:15,171 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-03 09:39:15,179 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 23 of 27 statements. [2025-03-03 09:39:15,179 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:39:15,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:15,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:39:15,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:15,229 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:39:15,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:15,256 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:39:15,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973648656] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:15,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:15,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2025-03-03 09:39:15,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848872157] [2025-03-03 09:39:15,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:15,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 09:39:15,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:15,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 09:39:15,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:39:15,258 INFO L87 Difference]: Start difference. First operand 66 states and 85 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:15,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:15,354 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2025-03-03 09:39:15,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:39:15,355 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-03 09:39:15,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:15,355 INFO L225 Difference]: With dead ends: 96 [2025-03-03 09:39:15,355 INFO L226 Difference]: Without dead ends: 45 [2025-03-03 09:39:15,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:39:15,356 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:15,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 30 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:39:15,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-03 09:39:15,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2025-03-03 09:39:15,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:15,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2025-03-03 09:39:15,362 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 27 [2025-03-03 09:39:15,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:15,362 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-03-03 09:39:15,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:15,362 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2025-03-03 09:39:15,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 09:39:15,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:15,363 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:15,368 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-03 09:39:15,563 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-03 09:39:15,564 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:15,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:15,564 INFO L85 PathProgramCache]: Analyzing trace with hash 310323410, now seen corresponding path program 2 times [2025-03-03 09:39:15,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:15,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445063775] [2025-03-03 09:39:15,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:39:15,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:15,569 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-03 09:39:15,579 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:39:15,579 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:39:15,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:16,014 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:39:16,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:16,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445063775] [2025-03-03 09:39:16,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445063775] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:16,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820313647] [2025-03-03 09:39:16,014 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:39:16,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:16,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:16,016 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-03 09:39:16,018 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-03 09:39:16,064 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-03 09:39:16,081 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:39:16,081 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:39:16,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:16,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-03 09:39:16,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:16,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:39:16,204 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-03 09:39:16,268 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-03 09:39:16,351 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-03 09:39:16,376 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:39:16,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:16,703 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:39:16,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820313647] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:16,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:16,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 37 [2025-03-03 09:39:16,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402661460] [2025-03-03 09:39:16,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:16,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-03 09:39:16,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:16,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-03 09:39:16,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1205, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 09:39:16,704 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 37 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 37 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-03 09:39:17,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:17,575 INFO L93 Difference]: Finished difference Result 108 states and 141 transitions. [2025-03-03 09:39:17,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-03 09:39:17,576 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 37 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) Word has length 31 [2025-03-03 09:39:17,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:17,576 INFO L225 Difference]: With dead ends: 108 [2025-03-03 09:39:17,576 INFO L226 Difference]: Without dead ends: 101 [2025-03-03 09:39:17,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=424, Invalid=3358, Unknown=0, NotChecked=0, Total=3782 [2025-03-03 09:39:17,578 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 38 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:17,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 85 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:39:17,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-03 09:39:17,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 86. [2025-03-03 09:39:17,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:17,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 110 transitions. [2025-03-03 09:39:17,593 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 110 transitions. Word has length 31 [2025-03-03 09:39:17,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:17,594 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 110 transitions. [2025-03-03 09:39:17,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 37 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-03 09:39:17,594 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 110 transitions. [2025-03-03 09:39:17,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 09:39:17,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:17,594 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:17,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 09:39:17,795 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-03 09:39:17,795 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:17,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:17,795 INFO L85 PathProgramCache]: Analyzing trace with hash 311246931, now seen corresponding path program 2 times [2025-03-03 09:39:17,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:17,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58869959] [2025-03-03 09:39:17,795 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:39:17,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:17,801 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-03 09:39:17,810 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:39:17,811 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:39:17,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:17,999 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:39:18,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:18,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58869959] [2025-03-03 09:39:18,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58869959] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:18,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830183445] [2025-03-03 09:39:18,000 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:39:18,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:18,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:18,002 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-03 09:39:18,004 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-03 09:39:18,050 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-03 09:39:18,071 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:39:18,071 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:39:18,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:18,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-03 09:39:18,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:18,109 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-03 09:39:18,147 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-03 09:39:18,175 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-03 09:39:18,198 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:39:18,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:18,241 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-03 09:39:18,243 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-03 09:39:18,246 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:39:18,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830183445] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:18,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:18,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2025-03-03 09:39:18,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127095110] [2025-03-03 09:39:18,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:18,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 09:39:18,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:18,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 09:39:18,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:39:18,247 INFO L87 Difference]: Start difference. First operand 86 states and 110 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:18,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:18,401 INFO L93 Difference]: Finished difference Result 143 states and 189 transitions. [2025-03-03 09:39:18,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:39:18,404 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-03 09:39:18,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:18,404 INFO L225 Difference]: With dead ends: 143 [2025-03-03 09:39:18,404 INFO L226 Difference]: Without dead ends: 97 [2025-03-03 09:39:18,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:39:18,405 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:18,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 74 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:39:18,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-03 09:39:18,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2025-03-03 09:39:18,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 87 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:18,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 112 transitions. [2025-03-03 09:39:18,424 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 112 transitions. Word has length 31 [2025-03-03 09:39:18,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:18,424 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 112 transitions. [2025-03-03 09:39:18,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:18,424 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2025-03-03 09:39:18,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 09:39:18,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:18,425 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:18,431 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-03 09:39:18,629 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-03 09:39:18,629 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:18,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:18,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1196304878, now seen corresponding path program 2 times [2025-03-03 09:39:18,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:18,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29155534] [2025-03-03 09:39:18,630 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:39:18,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:18,635 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-03 09:39:18,650 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:39:18,650 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:39:18,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:18,947 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:39:18,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:18,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29155534] [2025-03-03 09:39:18,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29155534] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:18,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807695079] [2025-03-03 09:39:18,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:39:18,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:18,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:18,950 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-03 09:39:18,952 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-03 09:39:19,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-03 09:39:19,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:39:19,019 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:39:19,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:19,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 09:39:19,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:19,086 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-03 09:39:19,136 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:39:19,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:19,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-03 09:39:19,216 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-03 09:39:19,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2025-03-03 09:39:19,258 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:39:19,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807695079] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:19,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:19,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 11] total 30 [2025-03-03 09:39:19,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129272034] [2025-03-03 09:39:19,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:19,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 09:39:19,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:19,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 09:39:19,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2025-03-03 09:39:19,260 INFO L87 Difference]: Start difference. First operand 88 states and 112 transitions. Second operand has 30 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 30 states have internal predecessors, (67), 0 states have call successors, (0), 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-03 09:39:19,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:19,606 INFO L93 Difference]: Finished difference Result 120 states and 150 transitions. [2025-03-03 09:39:19,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 09:39:19,606 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 30 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-03 09:39:19,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:19,607 INFO L225 Difference]: With dead ends: 120 [2025-03-03 09:39:19,607 INFO L226 Difference]: Without dead ends: 114 [2025-03-03 09:39:19,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=303, Invalid=1419, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 09:39:19,607 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 147 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:19,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 73 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:39:19,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-03 09:39:19,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 94. [2025-03-03 09:39:19,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.2688172043010753) internal successors, (118), 93 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:19,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 118 transitions. [2025-03-03 09:39:19,621 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 118 transitions. Word has length 31 [2025-03-03 09:39:19,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:19,621 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 118 transitions. [2025-03-03 09:39:19,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 30 states have internal predecessors, (67), 0 states have call successors, (0), 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-03 09:39:19,621 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 118 transitions. [2025-03-03 09:39:19,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 09:39:19,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:19,622 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:19,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-03 09:39:19,822 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-03 09:39:19,822 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:19,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:19,823 INFO L85 PathProgramCache]: Analyzing trace with hash 480931090, now seen corresponding path program 5 times [2025-03-03 09:39:19,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:19,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916620699] [2025-03-03 09:39:19,823 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:39:19,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:19,828 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 4 equivalence classes. [2025-03-03 09:39:19,836 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 09:39:19,836 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-03 09:39:19,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:19,912 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:39:19,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:19,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916620699] [2025-03-03 09:39:19,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916620699] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:19,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191499395] [2025-03-03 09:39:19,913 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:39:19,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:19,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:19,915 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-03 09:39:19,916 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-03 09:39:19,965 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 4 equivalence classes. [2025-03-03 09:39:19,989 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 09:39:19,990 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-03 09:39:19,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:19,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 09:39:19,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:20,049 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:39:20,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:20,101 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:39:20,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191499395] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:20,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:20,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 15 [2025-03-03 09:39:20,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255388867] [2025-03-03 09:39:20,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:20,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 09:39:20,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:20,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 09:39:20,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:39:20,103 INFO L87 Difference]: Start difference. First operand 94 states and 118 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:20,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:20,353 INFO L93 Difference]: Finished difference Result 140 states and 174 transitions. [2025-03-03 09:39:20,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 09:39:20,353 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-03 09:39:20,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:20,354 INFO L225 Difference]: With dead ends: 140 [2025-03-03 09:39:20,354 INFO L226 Difference]: Without dead ends: 124 [2025-03-03 09:39:20,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 51 SyntacticMatches, 9 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2025-03-03 09:39:20,354 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 60 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:20,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 28 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:39:20,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-03 09:39:20,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 86. [2025-03-03 09:39:20,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 85 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:20,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2025-03-03 09:39:20,367 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 32 [2025-03-03 09:39:20,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:20,368 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2025-03-03 09:39:20,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:20,368 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2025-03-03 09:39:20,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 09:39:20,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:20,369 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:20,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-03 09:39:20,569 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-03 09:39:20,569 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:20,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:20,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1104470894, now seen corresponding path program 6 times [2025-03-03 09:39:20,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:20,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410386891] [2025-03-03 09:39:20,570 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:39:20,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:20,577 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 5 equivalence classes. [2025-03-03 09:39:20,589 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 09:39:20,589 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-03 09:39:20,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:20,666 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 15 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:39:20,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:20,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410386891] [2025-03-03 09:39:20,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410386891] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:20,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995307067] [2025-03-03 09:39:20,666 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:39:20,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:20,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:20,668 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-03 09:39:20,670 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-03 09:39:20,720 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 5 equivalence classes. [2025-03-03 09:39:20,747 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 09:39:20,747 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-03 09:39:20,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:20,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 09:39:20,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:20,822 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:39:20,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:20,880 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:39:20,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995307067] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:20,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:20,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 17 [2025-03-03 09:39:20,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531752318] [2025-03-03 09:39:20,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:20,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 09:39:20,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:20,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 09:39:20,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:39:20,881 INFO L87 Difference]: Start difference. First operand 86 states and 108 transitions. Second operand has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 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-03 09:39:20,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:20,978 INFO L93 Difference]: Finished difference Result 125 states and 153 transitions. [2025-03-03 09:39:20,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 09:39:20,978 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-03 09:39:20,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:20,979 INFO L225 Difference]: With dead ends: 125 [2025-03-03 09:39:20,979 INFO L226 Difference]: Without dead ends: 55 [2025-03-03 09:39:20,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 54 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:39:20,979 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 32 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:20,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 40 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:39:20,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-03 09:39:20,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2025-03-03 09:39:20,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:20,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2025-03-03 09:39:20,988 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 34 [2025-03-03 09:39:20,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:20,988 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2025-03-03 09:39:20,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 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-03 09:39:20,988 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2025-03-03 09:39:20,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 09:39:20,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:20,993 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:20,998 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-03 09:39:21,193 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-03 09:39:21,193 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:21,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:21,194 INFO L85 PathProgramCache]: Analyzing trace with hash 531594162, now seen corresponding path program 3 times [2025-03-03 09:39:21,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:21,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308851512] [2025-03-03 09:39:21,194 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:39:21,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:21,201 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 5 equivalence classes. [2025-03-03 09:39:21,215 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 09:39:21,215 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-03 09:39:21,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:21,595 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:39:21,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:21,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308851512] [2025-03-03 09:39:21,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308851512] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:21,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142553604] [2025-03-03 09:39:21,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:39:21,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:21,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:21,597 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-03 09:39:21,599 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-03 09:39:21,650 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 5 equivalence classes. [2025-03-03 09:39:21,689 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 09:39:21,689 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-03 09:39:21,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:21,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-03 09:39:21,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:21,696 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-03 09:39:21,841 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-03 09:39:21,908 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-03 09:39:21,997 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-03 09:39:22,090 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-03 09:39:22,136 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:39:22,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:22,681 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:39:22,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142553604] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:22,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:22,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 45 [2025-03-03 09:39:22,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636918851] [2025-03-03 09:39:22,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:22,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-03 09:39:22,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:22,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-03 09:39:22,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1847, Unknown=0, NotChecked=0, Total=1980 [2025-03-03 09:39:22,683 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 45 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 45 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-03 09:39:25,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:25,228 INFO L93 Difference]: Finished difference Result 177 states and 231 transitions. [2025-03-03 09:39:25,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-03 09:39:25,228 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 45 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) Word has length 38 [2025-03-03 09:39:25,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:25,229 INFO L225 Difference]: With dead ends: 177 [2025-03-03 09:39:25,229 INFO L226 Difference]: Without dead ends: 155 [2025-03-03 09:39:25,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2704 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=832, Invalid=10724, Unknown=0, NotChecked=0, Total=11556 [2025-03-03 09:39:25,231 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 112 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 2163 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 2292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 2163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:25,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 110 Invalid, 2292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 2163 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 09:39:25,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-03 09:39:25,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 131. [2025-03-03 09:39:25,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.2538461538461538) internal successors, (163), 130 states have internal predecessors, (163), 0 states have call successors, (0), 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-03 09:39:25,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 163 transitions. [2025-03-03 09:39:25,261 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 163 transitions. Word has length 38 [2025-03-03 09:39:25,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:25,261 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 163 transitions. [2025-03-03 09:39:25,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 45 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-03 09:39:25,261 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 163 transitions. [2025-03-03 09:39:25,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 09:39:25,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:25,261 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:25,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-03 09:39:25,462 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-03 09:39:25,462 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:25,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:25,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1529590036, now seen corresponding path program 3 times [2025-03-03 09:39:25,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:25,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917222010] [2025-03-03 09:39:25,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:39:25,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:25,468 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 5 equivalence classes. [2025-03-03 09:39:25,475 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 38 statements. [2025-03-03 09:39:25,475 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:39:25,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:25,752 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 09:39:25,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:25,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917222010] [2025-03-03 09:39:25,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917222010] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:25,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729868211] [2025-03-03 09:39:25,752 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:39:25,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:25,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:25,754 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-03 09:39:25,766 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-03 09:39:25,820 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 5 equivalence classes. [2025-03-03 09:39:25,837 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 38 statements. [2025-03-03 09:39:25,837 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:39:25,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:25,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 09:39:25,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:25,862 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 27 treesize of output 15 [2025-03-03 09:39:25,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:39:25,939 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-03 09:39:25,974 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 09:39:25,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:26,098 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 09:39:26,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729868211] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:26,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:26,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 25 [2025-03-03 09:39:26,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310050639] [2025-03-03 09:39:26,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:26,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 09:39:26,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:26,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 09:39:26,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2025-03-03 09:39:26,100 INFO L87 Difference]: Start difference. First operand 131 states and 163 transitions. Second operand has 25 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:27,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:27,181 INFO L93 Difference]: Finished difference Result 263 states and 340 transitions. [2025-03-03 09:39:27,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-03-03 09:39:27,182 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-03 09:39:27,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:27,182 INFO L225 Difference]: With dead ends: 263 [2025-03-03 09:39:27,182 INFO L226 Difference]: Without dead ends: 222 [2025-03-03 09:39:27,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1026, Invalid=3530, Unknown=0, NotChecked=0, Total=4556 [2025-03-03 09:39:27,184 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 210 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:27,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 138 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:39:27,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-03 09:39:27,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 172. [2025-03-03 09:39:27,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.304093567251462) internal successors, (223), 171 states have internal predecessors, (223), 0 states have call successors, (0), 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-03 09:39:27,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 223 transitions. [2025-03-03 09:39:27,216 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 223 transitions. Word has length 38 [2025-03-03 09:39:27,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:27,216 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 223 transitions. [2025-03-03 09:39:27,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:27,216 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 223 transitions. [2025-03-03 09:39:27,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 09:39:27,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:27,217 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:27,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-03 09:39:27,421 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-03 09:39:27,421 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:27,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:27,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1377785327, now seen corresponding path program 4 times [2025-03-03 09:39:27,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:27,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418041319] [2025-03-03 09:39:27,422 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:39:27,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:27,429 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-03-03 09:39:27,434 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 35 of 39 statements. [2025-03-03 09:39:27,437 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:39:27,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:27,610 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 09:39:27,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:27,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418041319] [2025-03-03 09:39:27,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418041319] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:27,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533459872] [2025-03-03 09:39:27,611 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:39:27,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:27,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:27,613 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-03 09:39:27,614 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-03 09:39:27,675 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-03-03 09:39:27,688 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 35 of 39 statements. [2025-03-03 09:39:27,688 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:39:27,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:27,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-03 09:39:27,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:27,695 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-03 09:39:27,737 INFO L349 Elim1Store]: treesize reduction 22, result has 42.1 percent of original size [2025-03-03 09:39:27,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2025-03-03 09:39:27,784 INFO L349 Elim1Store]: treesize reduction 24, result has 40.0 percent of original size [2025-03-03 09:39:27,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 24 [2025-03-03 09:39:27,844 INFO L349 Elim1Store]: treesize reduction 24, result has 40.0 percent of original size [2025-03-03 09:39:27,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 27 [2025-03-03 09:39:27,921 INFO L349 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2025-03-03 09:39:27,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 35 [2025-03-03 09:39:27,981 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 09:39:27,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:28,472 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 37 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 09:39:28,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533459872] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:28,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:28,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 18] total 35 [2025-03-03 09:39:28,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730159840] [2025-03-03 09:39:28,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:28,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-03 09:39:28,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:28,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-03 09:39:28,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=977, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 09:39:28,474 INFO L87 Difference]: Start difference. First operand 172 states and 223 transitions. Second operand has 35 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:29,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:29,187 INFO L93 Difference]: Finished difference Result 201 states and 256 transitions. [2025-03-03 09:39:29,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-03 09:39:29,187 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-03 09:39:29,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:29,188 INFO L225 Difference]: With dead ends: 201 [2025-03-03 09:39:29,188 INFO L226 Difference]: Without dead ends: 129 [2025-03-03 09:39:29,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=628, Invalid=2234, Unknown=0, NotChecked=0, Total=2862 [2025-03-03 09:39:29,189 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 32 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:29,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 66 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:39:29,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-03 09:39:29,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 100. [2025-03-03 09:39:29,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.2121212121212122) internal successors, (120), 99 states have internal predecessors, (120), 0 states have call successors, (0), 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-03 09:39:29,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 120 transitions. [2025-03-03 09:39:29,208 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 120 transitions. Word has length 39 [2025-03-03 09:39:29,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:29,208 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 120 transitions. [2025-03-03 09:39:29,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:29,208 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 120 transitions. [2025-03-03 09:39:29,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 09:39:29,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:29,209 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:29,218 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-03 09:39:29,409 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-03 09:39:29,409 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:29,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:29,410 INFO L85 PathProgramCache]: Analyzing trace with hash -380712974, now seen corresponding path program 7 times [2025-03-03 09:39:29,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:29,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259081142] [2025-03-03 09:39:29,410 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:39:29,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:29,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 09:39:29,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 09:39:29,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:39:29,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:29,524 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:39:29,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:29,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259081142] [2025-03-03 09:39:29,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259081142] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:29,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771409843] [2025-03-03 09:39:29,529 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:39:29,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:29,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:29,533 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-03 09:39:29,535 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-03 09:39:29,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 09:39:29,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 09:39:29,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:39:29,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:29,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 09:39:29,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:29,755 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:39:29,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:29,829 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:39:29,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771409843] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:29,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:29,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2025-03-03 09:39:29,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756980730] [2025-03-03 09:39:29,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:29,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 09:39:29,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:29,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 09:39:29,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:39:29,831 INFO L87 Difference]: Start difference. First operand 100 states and 120 transitions. Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:30,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:39:30,093 INFO L93 Difference]: Finished difference Result 141 states and 169 transitions. [2025-03-03 09:39:30,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 09:39:30,093 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-03 09:39:30,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:39:30,094 INFO L225 Difference]: With dead ends: 141 [2025-03-03 09:39:30,094 INFO L226 Difference]: Without dead ends: 117 [2025-03-03 09:39:30,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 61 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-03 09:39:30,094 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 139 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:39:30,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 34 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:39:30,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-03 09:39:30,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 95. [2025-03-03 09:39:30,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.202127659574468) internal successors, (113), 94 states have internal predecessors, (113), 0 states have call successors, (0), 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-03 09:39:30,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 113 transitions. [2025-03-03 09:39:30,112 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 113 transitions. Word has length 39 [2025-03-03 09:39:30,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:39:30,112 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 113 transitions. [2025-03-03 09:39:30,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:39:30,113 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 113 transitions. [2025-03-03 09:39:30,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 09:39:30,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:39:30,113 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:39:30,119 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-03 09:39:30,313 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-03 09:39:30,314 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:39:30,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:39:30,314 INFO L85 PathProgramCache]: Analyzing trace with hash 449866224, now seen corresponding path program 5 times [2025-03-03 09:39:30,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:39:30,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023171802] [2025-03-03 09:39:30,314 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:39:30,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:39:30,322 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 6 equivalence classes. [2025-03-03 09:39:30,331 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 09:39:30,332 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-03 09:39:30,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:30,829 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 09:39:30,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:39:30,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023171802] [2025-03-03 09:39:30,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023171802] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:39:30,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172564041] [2025-03-03 09:39:30,829 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:39:30,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:39:30,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:39:30,831 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-03 09:39:30,832 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-03 09:39:30,890 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 6 equivalence classes. [2025-03-03 09:39:32,054 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 09:39:32,054 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-03 09:39:32,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:39:32,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-03 09:39:32,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:39:32,128 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-03 09:39:32,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:39:32,153 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-03 09:39:32,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:39:32,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:39:32,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:39:32,246 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 32 treesize of output 23 [2025-03-03 09:39:32,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:39:32,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:39:32,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:39:32,296 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 32 treesize of output 23 [2025-03-03 09:39:32,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:39:32,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:39:32,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:39:32,351 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 32 treesize of output 23 [2025-03-03 09:39:32,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:39:32,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2025-03-03 09:39:32,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:39:32,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:39:32,503 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-03-03 09:39:32,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2025-03-03 09:39:32,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:39:32,734 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 22 treesize of output 10 [2025-03-03 09:39:32,756 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 18 proven. 65 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 09:39:32,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:43,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 118 [2025-03-03 09:39:43,577 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 84 treesize of output 80 [2025-03-03 09:39:43,706 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 22 proven. 61 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 09:39:43,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172564041] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:43,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:43,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 25] total 67 [2025-03-03 09:39:43,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874725922] [2025-03-03 09:39:43,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:43,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-03-03 09:39:43,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:43,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-03-03 09:39:43,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=4076, Unknown=2, NotChecked=0, Total=4422 [2025-03-03 09:39:43,707 INFO L87 Difference]: Start difference. First operand 95 states and 113 transitions. Second operand has 67 states, 67 states have (on average 1.5970149253731343) internal successors, (107), 67 states have internal predecessors, (107), 0 states have call successors, (0), 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-03 09:39:48,893 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (select |c_#memory_int#3| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse11 (+ .cse16 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse6 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse4 (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (select .cse3 .cse11)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse9 (+ 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse10 (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_961 Int)) (let ((.cse0 (store .cse3 .cse4 v_ArrVal_961))) (or (not (= 2 (select .cse0 .cse1))) (not (= 2 (select .cse0 .cse2)))))) (<= 5 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_291| Int)) (or (forall ((v_ArrVal_961 Int)) (let ((.cse5 (store .cse3 (+ (* |v_ULTIMATE.start_main_~i~0#1_291| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_961))) (or (not (= 2 (select .cse5 .cse2))) (not (= 2 (select .cse5 .cse1)))))) (< |v_ULTIMATE.start_main_~i~0#1_291| .cse6))) (forall ((v_ArrVal_961 Int) (v_ArrVal_959 Int) (v_ArrVal_957 Int) (v_ArrVal_955 Int) (|v_ULTIMATE.start_main_~i~0#1_291| Int)) (let ((.cse8 (store (store (store (store .cse3 .cse4 v_ArrVal_955) .cse10 v_ArrVal_957) .cse11 v_ArrVal_959) (+ (* |v_ULTIMATE.start_main_~i~0#1_291| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_961))) (or (< .cse7 (+ v_ArrVal_959 1)) (not (= (select .cse8 .cse2) 2)) (not (= (select .cse8 .cse1) 2)) (< |v_ULTIMATE.start_main_~i~0#1_291| .cse9)))) (<= (select .cse3 12) 0) (forall ((v_ArrVal_961 Int) (v_ArrVal_959 Int) (v_ArrVal_957 Int) (|v_ULTIMATE.start_main_~i~0#1_291| Int)) (let ((.cse12 (store (store (store .cse3 .cse4 v_ArrVal_957) .cse10 v_ArrVal_959) (+ (* |v_ULTIMATE.start_main_~i~0#1_291| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_961))) (or (not (= (select .cse12 .cse2) 2)) (not (= (select .cse12 .cse1) 2)) (< |v_ULTIMATE.start_main_~i~0#1_291| (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (< (select .cse3 .cse10) (+ v_ArrVal_959 1))))) (forall ((v_ArrVal_961 Int) (v_ArrVal_959 Int) (|v_ULTIMATE.start_main_~i~0#1_291| Int)) (let ((.cse13 (store (store .cse3 .cse4 v_ArrVal_959) (+ (* |v_ULTIMATE.start_main_~i~0#1_291| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_961))) (or (not (= (select .cse13 .cse1) 2)) (< |v_ULTIMATE.start_main_~i~0#1_291| .cse6) (not (= (select .cse13 .cse2) 2)) (< (select .cse3 .cse4) (+ v_ArrVal_959 1))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_ArrVal_961 Int) (v_ArrVal_959 Int) (v_ArrVal_957 Int) (v_ArrVal_955 Int) (|v_ULTIMATE.start_main_~i~0#1_291| Int) (v_ArrVal_952 Int)) (let ((.cse15 (+ .cse16 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse14 (store (store (store (store (store .cse3 .cse4 v_ArrVal_952) .cse10 v_ArrVal_955) .cse11 v_ArrVal_957) .cse15 v_ArrVal_959) (+ (* |v_ULTIMATE.start_main_~i~0#1_291| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_961))) (or (not (= (select .cse14 .cse1) 2)) (< (select .cse3 .cse15) (+ v_ArrVal_959 1)) (< |v_ULTIMATE.start_main_~i~0#1_291| (+ |c_ULTIMATE.start_main_~i~0#1| 4)) (not (= 2 (select .cse14 .cse2))))))) (= 0 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (= c_~N~0 5) (<= |c_ULTIMATE.start_main_~i~0#1| 5) (forall ((v_ArrVal_961 Int) (v_ArrVal_959 Int) (v_ArrVal_957 Int) (|v_ULTIMATE.start_main_~i~0#1_291| Int)) (let ((.cse17 (store (store (store .cse3 .cse10 v_ArrVal_957) .cse11 v_ArrVal_959) (+ (* |v_ULTIMATE.start_main_~i~0#1_291| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_961))) (or (not (= 2 (select .cse17 .cse2))) (< .cse7 (+ v_ArrVal_959 1)) (not (= (select .cse17 .cse1) 2)) (< |v_ULTIMATE.start_main_~i~0#1_291| .cse9)))))))) is different from false [2025-03-03 09:40:08,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-03 09:40:13,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]