./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s42if.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/s42if.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 7a409beec5345d23de858b9cfc2d898f0f9067f3e0e10973225e4b6022343f4a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:40:02,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:40:02,367 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:40:02,371 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:40:02,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:40:02,392 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:40:02,394 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:40:02,394 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:40:02,394 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:40:02,395 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:40:02,395 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:40:02,395 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:40:02,396 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:40:02,396 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:40:02,396 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:40:02,396 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:40:02,397 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:40:02,397 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:40:02,397 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:40:02,397 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:40:02,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:40:02,397 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:40:02,397 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:40:02,397 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:40:02,397 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:40:02,397 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:40:02,397 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:40:02,398 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:40:02,398 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:40:02,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:40:02,398 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:40:02,398 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:40:02,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:40:02,398 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:40:02,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:40:02,399 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:40:02,399 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:40:02,399 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:40:02,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:40:02,399 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:40:02,399 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:40:02,399 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:40:02,399 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:40:02,399 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 -> 7a409beec5345d23de858b9cfc2d898f0f9067f3e0e10973225e4b6022343f4a [2025-03-03 09:40:02,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:40:02,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:40:02,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:40:02,631 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:40:02,631 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:40:02,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s42if.c [2025-03-03 09:40:03,767 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/967faf7f3/4b85a6c12abf4229bc8ba507ff2bdbaf/FLAG70abee0b6 [2025-03-03 09:40:03,972 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:40:03,978 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s42if.c [2025-03-03 09:40:03,989 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/967faf7f3/4b85a6c12abf4229bc8ba507ff2bdbaf/FLAG70abee0b6 [2025-03-03 09:40:04,327 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/967faf7f3/4b85a6c12abf4229bc8ba507ff2bdbaf [2025-03-03 09:40:04,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:40:04,331 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:40:04,332 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:40:04,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:40:04,336 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:40:04,337 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:40:04" (1/1) ... [2025-03-03 09:40:04,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12bdde71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:04, skipping insertion in model container [2025-03-03 09:40:04,338 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:40:04" (1/1) ... [2025-03-03 09:40:04,350 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:40:04,448 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/s42if.c[588,601] [2025-03-03 09:40:04,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:40:04,470 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:40:04,478 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/s42if.c[588,601] [2025-03-03 09:40:04,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:40:04,493 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:40:04,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:04 WrapperNode [2025-03-03 09:40:04,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:40:04,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:40:04,496 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:40:04,497 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:40:04,501 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:40:04" (1/1) ... [2025-03-03 09:40:04,506 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:40:04" (1/1) ... [2025-03-03 09:40:04,521 INFO L138 Inliner]: procedures = 17, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2025-03-03 09:40:04,521 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:40:04,521 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:40:04,521 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:40:04,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:40:04,528 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:04" (1/1) ... [2025-03-03 09:40:04,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:04" (1/1) ... [2025-03-03 09:40:04,530 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:04" (1/1) ... [2025-03-03 09:40:04,538 INFO L175 MemorySlicer]: Split 25 memory accesses to 4 slices as follows [2, 8, 6, 9]. 36 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0, 0]. The 6 writes are split as follows [0, 0, 3, 3]. [2025-03-03 09:40:04,539 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:04" (1/1) ... [2025-03-03 09:40:04,539 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:04" (1/1) ... [2025-03-03 09:40:04,542 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:04" (1/1) ... [2025-03-03 09:40:04,543 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:04" (1/1) ... [2025-03-03 09:40:04,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:04" (1/1) ... [2025-03-03 09:40:04,544 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:04" (1/1) ... [2025-03-03 09:40:04,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:40:04,547 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:40:04,547 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:40:04,547 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:40:04,548 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:04" (1/1) ... [2025-03-03 09:40:04,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:40:04,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:04,571 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:40:04,573 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:40:04,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:40:04,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:40:04,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:40:04,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 09:40:04,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 09:40:04,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:40:04,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:40:04,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:40:04,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 09:40:04,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 09:40:04,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-03 09:40:04,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:40:04,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:40:04,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:40:04,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:40:04,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 09:40:04,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 09:40:04,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:40:04,644 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:40:04,646 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:40:04,775 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:40:04,781 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 09:40:04,781 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:40:04,787 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:40:04,788 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:40:04,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:40:04 BoogieIcfgContainer [2025-03-03 09:40:04,788 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:40:04,790 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:40:04,790 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:40:04,793 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:40:04,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:40:04" (1/3) ... [2025-03-03 09:40:04,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a1aa9cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:40:04, skipping insertion in model container [2025-03-03 09:40:04,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:04" (2/3) ... [2025-03-03 09:40:04,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a1aa9cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:40:04, skipping insertion in model container [2025-03-03 09:40:04,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:40:04" (3/3) ... [2025-03-03 09:40:04,795 INFO L128 eAbstractionObserver]: Analyzing ICFG s42if.c [2025-03-03 09:40:04,805 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:40:04,806 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s42if.c that has 1 procedures, 19 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-03 09:40:04,838 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:40:04,845 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;@5130f045, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:40:04,845 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:40:04,848 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:40:04,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 09:40:04,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:04,851 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:04,851 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:04,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:04,855 INFO L85 PathProgramCache]: Analyzing trace with hash -411444654, now seen corresponding path program 1 times [2025-03-03 09:40:04,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:04,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580282939] [2025-03-03 09:40:04,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:04,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:04,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 09:40:04,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 09:40:04,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:04,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:04,988 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:40:04,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:04,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580282939] [2025-03-03 09:40:04,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580282939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:40:04,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:40:04,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:40:04,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18578326] [2025-03-03 09:40:04,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:40:04,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 09:40:04,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:05,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 09:40:05,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:40:05,018 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:40:05,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:05,026 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2025-03-03 09:40:05,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 09:40:05,028 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:40:05,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:05,031 INFO L225 Difference]: With dead ends: 34 [2025-03-03 09:40:05,032 INFO L226 Difference]: Without dead ends: 15 [2025-03-03 09:40:05,035 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:40:05,037 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:40:05,038 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:40:05,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-03 09:40:05,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-03 09:40:05,052 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:40:05,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2025-03-03 09:40:05,056 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 10 [2025-03-03 09:40:05,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:05,056 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-03-03 09:40:05,056 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:40:05,056 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2025-03-03 09:40:05,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 09:40:05,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:05,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:05,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:40:05,057 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:05,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:05,058 INFO L85 PathProgramCache]: Analyzing trace with hash 476059027, now seen corresponding path program 1 times [2025-03-03 09:40:05,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:05,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198486876] [2025-03-03 09:40:05,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:05,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:05,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 09:40:05,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 09:40:05,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:05,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:05,180 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:40:05,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:05,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198486876] [2025-03-03 09:40:05,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198486876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:40:05,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:40:05,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:40:05,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643878547] [2025-03-03 09:40:05,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:40:05,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:40:05,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:05,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:40:05,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:40:05,182 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:40:05,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:05,243 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2025-03-03 09:40:05,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:40:05,243 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:40:05,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:05,244 INFO L225 Difference]: With dead ends: 31 [2025-03-03 09:40:05,245 INFO L226 Difference]: Without dead ends: 22 [2025-03-03 09:40:05,245 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:40:05,245 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:40:05,245 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:40:05,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-03 09:40:05,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2025-03-03 09:40:05,248 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:40:05,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-03 09:40:05,249 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2025-03-03 09:40:05,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:05,249 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-03 09:40:05,249 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:40:05,249 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-03 09:40:05,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 09:40:05,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:05,250 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:40:05,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:40:05,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:05,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:05,250 INFO L85 PathProgramCache]: Analyzing trace with hash 330064146, now seen corresponding path program 1 times [2025-03-03 09:40:05,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:05,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609344429] [2025-03-03 09:40:05,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:05,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:05,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 09:40:05,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:40:05,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:05,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:05,705 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:40:05,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:05,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609344429] [2025-03-03 09:40:05,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609344429] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:05,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604942768] [2025-03-03 09:40:05,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:05,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:05,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:05,708 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:40:05,710 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:40:05,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 09:40:05,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:40:05,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:05,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:05,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 09:40:05,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:05,819 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:40:05,869 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:40:05,910 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:40:05,922 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:40:05,922 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:06,063 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:40:06,066 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:40:06,084 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:40:06,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604942768] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:06,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:06,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2025-03-03 09:40:06,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193894811] [2025-03-03 09:40:06,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:06,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 09:40:06,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:06,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 09:40:06,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2025-03-03 09:40:06,086 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:40:07,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:07,156 INFO L93 Difference]: Finished difference Result 129 states and 184 transitions. [2025-03-03 09:40:07,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-03 09:40:07,156 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:40:07,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:07,158 INFO L225 Difference]: With dead ends: 129 [2025-03-03 09:40:07,159 INFO L226 Difference]: Without dead ends: 119 [2025-03-03 09:40:07,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=752, Invalid=3538, Unknown=0, NotChecked=0, Total=4290 [2025-03-03 09:40:07,164 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 244 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:07,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 67 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:40:07,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-03 09:40:07,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 46. [2025-03-03 09:40:07,175 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:40:07,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2025-03-03 09:40:07,177 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 17 [2025-03-03 09:40:07,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:07,177 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2025-03-03 09:40:07,177 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:40:07,177 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2025-03-03 09:40:07,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 09:40:07,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:07,178 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:40:07,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 09:40:07,378 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:40:07,379 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:07,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:07,379 INFO L85 PathProgramCache]: Analyzing trace with hash 330987667, now seen corresponding path program 1 times [2025-03-03 09:40:07,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:07,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380908483] [2025-03-03 09:40:07,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:07,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:07,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 09:40:07,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:40:07,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:07,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:07,538 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:40:07,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:07,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380908483] [2025-03-03 09:40:07,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380908483] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:07,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936674473] [2025-03-03 09:40:07,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:07,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:07,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:07,542 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:40:07,544 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:40:07,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 09:40:07,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:40:07,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:07,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:07,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 09:40:07,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:07,602 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:40:07,622 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:40:07,622 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:07,648 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:40:07,649 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:40:07,656 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:40:07,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936674473] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:07,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:07,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 09:40:07,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901343309] [2025-03-03 09:40:07,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:07,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 09:40:07,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:07,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 09:40:07,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:40:07,657 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:40:07,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:07,708 INFO L93 Difference]: Finished difference Result 72 states and 100 transitions. [2025-03-03 09:40:07,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:40:07,709 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:40:07,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:07,709 INFO L225 Difference]: With dead ends: 72 [2025-03-03 09:40:07,709 INFO L226 Difference]: Without dead ends: 38 [2025-03-03 09:40:07,709 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:40:07,710 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:07,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 37 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:40:07,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-03 09:40:07,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2025-03-03 09:40:07,716 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:40:07,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2025-03-03 09:40:07,717 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 17 [2025-03-03 09:40:07,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:07,717 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2025-03-03 09:40:07,717 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:40:07,717 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2025-03-03 09:40:07,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 09:40:07,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:07,718 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:40:07,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 09:40:07,923 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:40:07,924 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:07,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:07,924 INFO L85 PathProgramCache]: Analyzing trace with hash 2138442130, now seen corresponding path program 1 times [2025-03-03 09:40:07,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:07,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900409720] [2025-03-03 09:40:07,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:07,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:07,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 09:40:07,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:40:07,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:07,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:08,123 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:40:08,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:08,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900409720] [2025-03-03 09:40:08,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900409720] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:08,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383206737] [2025-03-03 09:40:08,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:08,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:08,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:08,126 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:40:08,127 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:40:08,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 09:40:08,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:40:08,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:08,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:08,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 09:40:08,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:08,226 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:40:08,247 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:40:08,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:08,296 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:40:08,303 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-03 09:40:08,303 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:40:08,312 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:40:08,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383206737] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:08,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:08,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 15 [2025-03-03 09:40:08,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764191653] [2025-03-03 09:40:08,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:08,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 09:40:08,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:08,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 09:40:08,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:40:08,313 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:40:08,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:08,416 INFO L93 Difference]: Finished difference Result 73 states and 98 transitions. [2025-03-03 09:40:08,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 09:40:08,416 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:40:08,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:08,417 INFO L225 Difference]: With dead ends: 73 [2025-03-03 09:40:08,417 INFO L226 Difference]: Without dead ends: 62 [2025-03-03 09:40:08,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:40:08,417 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 45 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:08,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 56 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:40:08,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-03 09:40:08,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 40. [2025-03-03 09:40:08,423 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:40:08,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2025-03-03 09:40:08,423 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 17 [2025-03-03 09:40:08,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:08,423 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 53 transitions. [2025-03-03 09:40:08,423 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:40:08,424 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2025-03-03 09:40:08,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 09:40:08,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:08,424 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:40:08,430 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:40:08,628 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:40:08,628 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:08,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:08,628 INFO L85 PathProgramCache]: Analyzing trace with hash 658744914, now seen corresponding path program 1 times [2025-03-03 09:40:08,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:08,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120345492] [2025-03-03 09:40:08,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:08,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:08,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 09:40:08,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 09:40:08,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:08,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:08,688 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:40:08,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:08,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120345492] [2025-03-03 09:40:08,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120345492] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:08,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928661027] [2025-03-03 09:40:08,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:08,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:08,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:08,691 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:40:08,693 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:40:08,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 09:40:08,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 09:40:08,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:08,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:08,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:40:08,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:08,770 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:40:08,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:08,799 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:40:08,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928661027] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:08,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:08,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-03 09:40:08,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28821399] [2025-03-03 09:40:08,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:08,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 09:40:08,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:08,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 09:40:08,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:40:08,800 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:40:08,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:08,909 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2025-03-03 09:40:08,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:40:08,909 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:40:08,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:08,909 INFO L225 Difference]: With dead ends: 73 [2025-03-03 09:40:08,910 INFO L226 Difference]: Without dead ends: 65 [2025-03-03 09:40:08,910 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:40:08,910 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 52 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:08,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 19 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:40:08,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-03 09:40:08,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 45. [2025-03-03 09:40:08,916 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:40:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2025-03-03 09:40:08,916 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 18 [2025-03-03 09:40:08,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:08,916 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2025-03-03 09:40:08,916 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:40:08,916 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2025-03-03 09:40:08,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 09:40:08,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:08,917 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:40:08,922 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:40:09,117 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:40:09,117 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:09,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:09,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1750087954, now seen corresponding path program 2 times [2025-03-03 09:40:09,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:09,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924354889] [2025-03-03 09:40:09,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:40:09,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:09,128 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-03 09:40:09,136 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 09:40:09,136 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:40:09,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:09,223 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:40:09,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:09,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924354889] [2025-03-03 09:40:09,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924354889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:09,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120437893] [2025-03-03 09:40:09,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:40:09,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:09,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:09,226 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:40:09,228 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:40:09,266 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-03 09:40:09,277 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 09:40:09,277 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:40:09,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:09,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:40:09,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:09,311 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:40:09,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:09,338 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:40:09,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120437893] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:09,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:09,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-03 09:40:09,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648661428] [2025-03-03 09:40:09,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:09,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 09:40:09,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:09,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 09:40:09,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:40:09,339 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:40:09,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:09,404 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2025-03-03 09:40:09,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:40:09,404 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:40:09,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:09,405 INFO L225 Difference]: With dead ends: 66 [2025-03-03 09:40:09,405 INFO L226 Difference]: Without dead ends: 35 [2025-03-03 09:40:09,405 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:40:09,405 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:09,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 24 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:40:09,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-03 09:40:09,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2025-03-03 09:40:09,409 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:40:09,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2025-03-03 09:40:09,409 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 20 [2025-03-03 09:40:09,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:09,410 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2025-03-03 09:40:09,410 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:40:09,410 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2025-03-03 09:40:09,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 09:40:09,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:09,410 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:40:09,416 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:40:09,611 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:40:09,611 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:09,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:09,611 INFO L85 PathProgramCache]: Analyzing trace with hash 2079589618, now seen corresponding path program 1 times [2025-03-03 09:40:09,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:09,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453992658] [2025-03-03 09:40:09,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:09,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:09,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 09:40:09,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:40:09,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:09,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:09,909 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:40:09,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:09,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453992658] [2025-03-03 09:40:09,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453992658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:09,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181147247] [2025-03-03 09:40:09,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:09,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:09,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:09,912 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:40:09,913 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:40:09,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 09:40:09,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:40:09,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:09,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:09,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-03 09:40:09,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:10,003 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:40:10,054 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:40:10,093 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:40:10,176 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:40:10,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:10,373 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:40:10,376 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:40:10,409 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:40:10,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181147247] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:10,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:10,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 32 [2025-03-03 09:40:10,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137737587] [2025-03-03 09:40:10,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:10,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 09:40:10,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:10,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 09:40:10,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=874, Unknown=0, NotChecked=0, Total=992 [2025-03-03 09:40:10,411 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:40:13,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:13,291 INFO L93 Difference]: Finished difference Result 241 states and 344 transitions. [2025-03-03 09:40:13,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2025-03-03 09:40:13,291 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:40:13,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:13,292 INFO L225 Difference]: With dead ends: 241 [2025-03-03 09:40:13,292 INFO L226 Difference]: Without dead ends: 230 [2025-03-03 09:40:13,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6839 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2236, Invalid=17224, Unknown=0, NotChecked=0, Total=19460 [2025-03-03 09:40:13,296 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 333 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:13,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 96 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:40:13,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-03 09:40:13,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 95. [2025-03-03 09:40:13,308 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:40:13,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 134 transitions. [2025-03-03 09:40:13,309 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 134 transitions. Word has length 24 [2025-03-03 09:40:13,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:13,309 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 134 transitions. [2025-03-03 09:40:13,309 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:40:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 134 transitions. [2025-03-03 09:40:13,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 09:40:13,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:13,310 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:40:13,316 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:40:13,510 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:40:13,511 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:13,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:13,511 INFO L85 PathProgramCache]: Analyzing trace with hash 2080513139, now seen corresponding path program 1 times [2025-03-03 09:40:13,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:13,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24093527] [2025-03-03 09:40:13,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:13,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:13,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 09:40:13,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:40:13,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:13,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:13,705 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:40:13,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:13,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24093527] [2025-03-03 09:40:13,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24093527] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:13,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982421067] [2025-03-03 09:40:13,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:13,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:13,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:13,708 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:40:13,710 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:40:13,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 09:40:13,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:40:13,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:13,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:13,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 09:40:13,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:13,773 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:40:13,790 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:40:13,804 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:40:13,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:13,836 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:40:13,838 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:40:13,853 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:40:13,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982421067] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:13,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:13,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-03 09:40:13,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495466019] [2025-03-03 09:40:13,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:13,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 09:40:13,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:13,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 09:40:13,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:40:13,856 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:40:13,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:13,946 INFO L93 Difference]: Finished difference Result 134 states and 187 transitions. [2025-03-03 09:40:13,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:40:13,948 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:40:13,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:13,948 INFO L225 Difference]: With dead ends: 134 [2025-03-03 09:40:13,948 INFO L226 Difference]: Without dead ends: 68 [2025-03-03 09:40:13,948 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:40:13,949 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:13,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 59 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:40:13,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-03 09:40:13,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2025-03-03 09:40:13,959 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:40:13,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2025-03-03 09:40:13,960 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 24 [2025-03-03 09:40:13,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:13,961 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2025-03-03 09:40:13,961 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:40:13,961 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2025-03-03 09:40:13,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 09:40:13,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:13,962 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:40:13,967 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:40:14,162 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:40:14,162 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:14,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:14,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1951430420, now seen corresponding path program 1 times [2025-03-03 09:40:14,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:14,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782226344] [2025-03-03 09:40:14,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:14,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:14,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 09:40:14,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:40:14,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:14,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:14,346 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:40:14,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:14,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782226344] [2025-03-03 09:40:14,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782226344] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:14,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036741552] [2025-03-03 09:40:14,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:14,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:14,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:14,349 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:40:14,350 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:40:14,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 09:40:14,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:40:14,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:14,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:14,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 09:40:14,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:14,444 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:40:14,471 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:40:14,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:14,520 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:40:14,525 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-03 09:40:14,525 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:40:14,541 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:40:14,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036741552] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:14,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:14,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 18 [2025-03-03 09:40:14,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450248478] [2025-03-03 09:40:14,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:14,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 09:40:14,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:14,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 09:40:14,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:40:14,543 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:40:14,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:14,683 INFO L93 Difference]: Finished difference Result 94 states and 122 transitions. [2025-03-03 09:40:14,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 09:40:14,684 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:40:14,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:14,684 INFO L225 Difference]: With dead ends: 94 [2025-03-03 09:40:14,684 INFO L226 Difference]: Without dead ends: 88 [2025-03-03 09:40:14,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:40:14,685 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 83 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:14,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 53 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:40:14,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-03 09:40:14,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 63. [2025-03-03 09:40:14,697 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:40:14,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2025-03-03 09:40:14,697 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 24 [2025-03-03 09:40:14,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:14,698 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2025-03-03 09:40:14,698 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:40:14,698 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2025-03-03 09:40:14,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 09:40:14,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:14,702 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:40:14,708 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:40:14,902 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:40:14,903 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:14,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:14,903 INFO L85 PathProgramCache]: Analyzing trace with hash 62951474, now seen corresponding path program 3 times [2025-03-03 09:40:14,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:14,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095708850] [2025-03-03 09:40:14,903 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:40:14,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:14,912 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-03-03 09:40:14,927 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:40:14,927 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:40:14,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:14,988 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:40:14,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:14,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095708850] [2025-03-03 09:40:14,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095708850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:14,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458727803] [2025-03-03 09:40:14,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:40:14,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:14,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:14,990 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:40:14,992 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:40:15,032 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-03-03 09:40:15,050 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:40:15,051 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:40:15,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:15,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:40:15,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:15,102 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:40:15,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:15,149 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:40:15,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458727803] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:15,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:15,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-03 09:40:15,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169983149] [2025-03-03 09:40:15,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:15,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 09:40:15,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:15,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 09:40:15,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:40:15,151 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:40:15,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:15,326 INFO L93 Difference]: Finished difference Result 108 states and 138 transitions. [2025-03-03 09:40:15,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:40:15,327 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:40:15,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:15,327 INFO L225 Difference]: With dead ends: 108 [2025-03-03 09:40:15,328 INFO L226 Difference]: Without dead ends: 97 [2025-03-03 09:40:15,328 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:40:15,328 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 56 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:15,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 29 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:40:15,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-03 09:40:15,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 66. [2025-03-03 09:40:15,337 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:40:15,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2025-03-03 09:40:15,337 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 85 transitions. Word has length 25 [2025-03-03 09:40:15,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:15,337 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 85 transitions. [2025-03-03 09:40:15,337 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:40:15,337 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2025-03-03 09:40:15,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 09:40:15,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:15,338 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:40:15,344 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:40:15,538 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:40:15,539 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:15,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:15,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1056818256, now seen corresponding path program 4 times [2025-03-03 09:40:15,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:15,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299257787] [2025-03-03 09:40:15,539 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:40:15,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:15,546 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-03 09:40:15,549 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:40:15,549 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:40:15,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:15,592 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:40:15,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:15,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299257787] [2025-03-03 09:40:15,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299257787] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:15,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076815601] [2025-03-03 09:40:15,593 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:40:15,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:15,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:15,595 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:40:15,596 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:40:15,642 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-03 09:40:15,650 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:40:15,651 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:40:15,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:15,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:40:15,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:15,703 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:40:15,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:15,736 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:40:15,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076815601] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:15,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:15,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2025-03-03 09:40:15,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62823847] [2025-03-03 09:40:15,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:15,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 09:40:15,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:15,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 09:40:15,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:40:15,737 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:40:15,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:15,840 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2025-03-03 09:40:15,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:40:15,840 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:40:15,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:15,841 INFO L225 Difference]: With dead ends: 96 [2025-03-03 09:40:15,841 INFO L226 Difference]: Without dead ends: 45 [2025-03-03 09:40:15,841 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:40:15,842 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 41 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:15,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 16 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:40:15,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-03 09:40:15,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2025-03-03 09:40:15,851 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:40:15,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2025-03-03 09:40:15,851 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 27 [2025-03-03 09:40:15,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:15,852 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-03-03 09:40:15,852 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:40:15,852 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2025-03-03 09:40:15,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 09:40:15,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:15,852 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:40:15,859 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:40:16,052 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:40:16,053 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:16,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:16,054 INFO L85 PathProgramCache]: Analyzing trace with hash 310323410, now seen corresponding path program 2 times [2025-03-03 09:40:16,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:16,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042601615] [2025-03-03 09:40:16,054 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:40:16,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:16,061 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-03 09:40:16,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:40:16,072 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:40:16,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:16,442 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:40:16,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:16,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042601615] [2025-03-03 09:40:16,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042601615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:16,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180060895] [2025-03-03 09:40:16,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:40:16,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:16,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:16,444 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:40:16,445 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:40:16,484 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-03 09:40:16,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:40:16,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:40:16,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:16,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-03 09:40:16,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:16,558 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:40:16,598 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:40:16,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:40:16,675 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:40:16,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:17,032 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:40:17,034 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:40:17,091 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:17,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180060895] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:17,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:17,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 17] total 40 [2025-03-03 09:40:17,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107915362] [2025-03-03 09:40:17,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:17,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-03 09:40:17,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:17,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-03 09:40:17,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1414, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 09:40:17,092 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 40 states, 40 states have (on average 1.725) internal successors, (69), 40 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:19,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:19,936 INFO L93 Difference]: Finished difference Result 187 states and 255 transitions. [2025-03-03 09:40:19,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2025-03-03 09:40:19,936 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.725) internal successors, (69), 40 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-03 09:40:19,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:19,937 INFO L225 Difference]: With dead ends: 187 [2025-03-03 09:40:19,937 INFO L226 Difference]: Without dead ends: 168 [2025-03-03 09:40:19,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4309 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1095, Invalid=13667, Unknown=0, NotChecked=0, Total=14762 [2025-03-03 09:40:19,940 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 247 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 1971 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 2104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:19,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 183 Invalid, 2104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1971 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 09:40:19,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-03 09:40:19,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 84. [2025-03-03 09:40:19,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 83 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:40:19,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 106 transitions. [2025-03-03 09:40:19,953 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 106 transitions. Word has length 31 [2025-03-03 09:40:19,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:19,953 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 106 transitions. [2025-03-03 09:40:19,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.725) internal successors, (69), 40 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:19,953 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 106 transitions. [2025-03-03 09:40:19,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 09:40:19,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:19,953 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:40:19,959 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:40:20,154 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:40:20,154 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:20,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:20,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1196304878, now seen corresponding path program 2 times [2025-03-03 09:40:20,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:20,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15449690] [2025-03-03 09:40:20,154 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:40:20,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:20,160 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-03 09:40:20,173 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:40:20,175 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:40:20,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:20,500 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:20,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:20,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15449690] [2025-03-03 09:40:20,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15449690] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:20,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483949785] [2025-03-03 09:40:20,500 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:40:20,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:20,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:20,503 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:40:20,503 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:40:20,550 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-03 09:40:20,572 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:40:20,572 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:40:20,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:20,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 09:40:20,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:20,619 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:40:20,676 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:40:20,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:20,768 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:40:20,775 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-03 09:40:20,776 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:40:20,809 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:40:20,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483949785] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:20,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:20,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 11] total 28 [2025-03-03 09:40:20,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507979789] [2025-03-03 09:40:20,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:20,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 09:40:20,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:20,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 09:40:20,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2025-03-03 09:40:20,811 INFO L87 Difference]: Start difference. First operand 84 states and 106 transitions. Second operand has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 28 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:40:21,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:21,146 INFO L93 Difference]: Finished difference Result 123 states and 157 transitions. [2025-03-03 09:40:21,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 09:40:21,146 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 28 states have internal predecessors, (66), 0 states have call successors, (0), 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:40:21,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:21,147 INFO L225 Difference]: With dead ends: 123 [2025-03-03 09:40:21,147 INFO L226 Difference]: Without dead ends: 117 [2025-03-03 09:40:21,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=303, Invalid=1419, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 09:40:21,148 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 104 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:21,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 90 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:40:21,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-03 09:40:21,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 90. [2025-03-03 09:40:21,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.2584269662921348) internal successors, (112), 89 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:40:21,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 112 transitions. [2025-03-03 09:40:21,161 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 112 transitions. Word has length 31 [2025-03-03 09:40:21,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:21,161 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 112 transitions. [2025-03-03 09:40:21,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 28 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:40:21,161 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 112 transitions. [2025-03-03 09:40:21,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 09:40:21,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:21,161 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:40:21,168 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:40:21,362 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:40:21,362 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:21,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:21,362 INFO L85 PathProgramCache]: Analyzing trace with hash 480931090, now seen corresponding path program 5 times [2025-03-03 09:40:21,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:21,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192471879] [2025-03-03 09:40:21,362 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:40:21,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:21,369 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 4 equivalence classes. [2025-03-03 09:40:21,378 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 09:40:21,379 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-03 09:40:21,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:21,461 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:40:21,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:21,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192471879] [2025-03-03 09:40:21,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192471879] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:21,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286336800] [2025-03-03 09:40:21,462 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:40:21,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:21,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:21,464 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:40:21,466 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:40:21,513 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 4 equivalence classes. [2025-03-03 09:40:21,550 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 09:40:21,550 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-03 09:40:21,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:21,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 09:40:21,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:21,618 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:40:21,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:21,676 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:40:21,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286336800] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:21,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:21,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 15 [2025-03-03 09:40:21,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269812285] [2025-03-03 09:40:21,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:21,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 09:40:21,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:21,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 09:40:21,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:40:21,680 INFO L87 Difference]: Start difference. First operand 90 states and 112 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:40:21,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:21,923 INFO L93 Difference]: Finished difference Result 146 states and 184 transitions. [2025-03-03 09:40:21,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 09:40:21,924 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:40:21,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:21,924 INFO L225 Difference]: With dead ends: 146 [2025-03-03 09:40:21,924 INFO L226 Difference]: Without dead ends: 132 [2025-03-03 09:40:21,924 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:40:21,925 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 78 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:21,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 30 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:40:21,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-03 09:40:21,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 90. [2025-03-03 09:40:21,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.2808988764044944) internal successors, (114), 89 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:21,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 114 transitions. [2025-03-03 09:40:21,939 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 114 transitions. Word has length 32 [2025-03-03 09:40:21,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:21,939 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 114 transitions. [2025-03-03 09:40:21,939 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:40:21,940 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2025-03-03 09:40:21,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 09:40:21,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:21,940 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:40:21,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-03 09:40:22,145 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:40:22,145 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:22,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:22,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1104470894, now seen corresponding path program 6 times [2025-03-03 09:40:22,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:22,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979352228] [2025-03-03 09:40:22,146 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:40:22,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:22,152 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 5 equivalence classes. [2025-03-03 09:40:22,163 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 09:40:22,163 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-03 09:40:22,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:22,236 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:40:22,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:22,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979352228] [2025-03-03 09:40:22,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979352228] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:22,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524763353] [2025-03-03 09:40:22,236 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:40:22,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:22,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:22,238 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:40:22,240 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:40:22,288 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 5 equivalence classes. [2025-03-03 09:40:22,315 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 09:40:22,316 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-03 09:40:22,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:22,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 09:40:22,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:22,396 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:40:22,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:22,457 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:40:22,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524763353] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:22,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:22,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2025-03-03 09:40:22,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186422006] [2025-03-03 09:40:22,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:22,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 09:40:22,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:22,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 09:40:22,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:40:22,459 INFO L87 Difference]: Start difference. First operand 90 states and 114 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:22,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:22,593 INFO L93 Difference]: Finished difference Result 129 states and 159 transitions. [2025-03-03 09:40:22,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 09:40:22,594 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-03 09:40:22,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:22,595 INFO L225 Difference]: With dead ends: 129 [2025-03-03 09:40:22,595 INFO L226 Difference]: Without dead ends: 55 [2025-03-03 09:40:22,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 55 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:40:22,596 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 76 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:22,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 25 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:40:22,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-03 09:40:22,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2025-03-03 09:40:22,603 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:40:22,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2025-03-03 09:40:22,604 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 34 [2025-03-03 09:40:22,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:22,604 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2025-03-03 09:40:22,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:22,604 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2025-03-03 09:40:22,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 09:40:22,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:22,605 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:40:22,615 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:40:22,806 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:40:22,806 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:22,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:22,806 INFO L85 PathProgramCache]: Analyzing trace with hash 531594162, now seen corresponding path program 3 times [2025-03-03 09:40:22,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:22,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767116382] [2025-03-03 09:40:22,806 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:40:22,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:22,814 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 5 equivalence classes. [2025-03-03 09:40:22,827 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 09:40:22,827 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-03 09:40:22,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:23,187 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:40:23,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:23,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767116382] [2025-03-03 09:40:23,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767116382] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:23,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657802514] [2025-03-03 09:40:23,188 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:40:23,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:23,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:23,191 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:40:23,191 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:40:23,244 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 5 equivalence classes. [2025-03-03 09:40:23,276 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 09:40:23,276 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-03 09:40:23,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:23,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-03 09:40:23,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:23,286 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:40:23,434 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:40:23,498 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:40:23,564 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:40:23,661 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:40:23,668 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2025-03-03 09:40:23,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 13 [2025-03-03 09:40:23,737 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:40:23,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:25,239 INFO L349 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2025-03-03 09:40:25,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 17 [2025-03-03 09:40:25,447 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:40:25,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657802514] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:25,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:25,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20, 19] total 49 [2025-03-03 09:40:25,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208115177] [2025-03-03 09:40:25,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:25,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-03 09:40:25,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:25,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-03 09:40:25,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2160, Unknown=1, NotChecked=0, Total=2352 [2025-03-03 09:40:25,449 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 49 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 49 states have internal predecessors, (82), 0 states have call successors, (0), 0 states 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:40:31,287 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:35,292 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:47,680 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:51,689 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:55,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-03-03 09:40:59,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-03-03 09:41:16,143 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:41:20,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-03 09:41:24,169 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:41:34,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-03 09:41:38,192 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:41:42,526 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:41:45,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]