./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p01.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p01.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 10c341169e851beaa907d6b4c856b8c9335bdf02c819f534595f4ceb4010e354 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:37:36,328 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:37:36,385 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 09:37:36,388 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:37:36,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:37:36,413 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:37:36,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:37:36,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:37:36,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:37:36,415 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:37:36,415 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:37:36,415 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:37:36,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:37:36,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:37:36,416 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:37:36,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:37:36,416 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:37:36,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 09:37:36,417 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:37:36,417 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:37:36,417 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:37:36,417 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:37:36,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:37:36,417 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:37:36,417 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:37:36,417 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:37:36,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:37:36,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:37:36,417 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:37:36,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:37:36,417 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:37:36,417 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:37:36,417 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:37:36,417 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:37:36,417 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 09:37:36,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 09:37:36,417 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:37:36,417 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:37:36,417 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:37:36,417 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:37:36,418 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10c341169e851beaa907d6b4c856b8c9335bdf02c819f534595f4ceb4010e354 [2025-03-08 09:37:36,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:37:36,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:37:36,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:37:36,665 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:37:36,665 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:37:36,667 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p01.c [2025-03-08 09:37:37,859 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91a6f0384/22ae12667e664a1ea5f9a410396310f7/FLAG626bf0fe8 [2025-03-08 09:37:38,120 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:37:38,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p01.c [2025-03-08 09:37:38,128 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91a6f0384/22ae12667e664a1ea5f9a410396310f7/FLAG626bf0fe8 [2025-03-08 09:37:38,430 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91a6f0384/22ae12667e664a1ea5f9a410396310f7 [2025-03-08 09:37:38,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:37:38,433 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:37:38,434 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:37:38,434 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:37:38,437 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:37:38,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:37:38" (1/1) ... [2025-03-08 09:37:38,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b1c57e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:38, skipping insertion in model container [2025-03-08 09:37:38,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:37:38" (1/1) ... [2025-03-08 09:37:38,455 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:37:38,547 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/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p01.c[1266,1279] [2025-03-08 09:37:38,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:37:38,637 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:37:38,643 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/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p01.c[1266,1279] [2025-03-08 09:37:38,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:37:38,715 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:37:38,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:38 WrapperNode [2025-03-08 09:37:38,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:37:38,717 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:37:38,717 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:37:38,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:37:38,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:38" (1/1) ... [2025-03-08 09:37:38,735 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:38" (1/1) ... [2025-03-08 09:37:38,807 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 747 [2025-03-08 09:37:38,807 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:37:38,808 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:37:38,808 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:37:38,808 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:37:38,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:38" (1/1) ... [2025-03-08 09:37:38,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:38" (1/1) ... [2025-03-08 09:37:38,833 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:38" (1/1) ... [2025-03-08 09:37:38,868 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 09:37:38,869 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:38" (1/1) ... [2025-03-08 09:37:38,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:38" (1/1) ... [2025-03-08 09:37:38,889 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:38" (1/1) ... [2025-03-08 09:37:38,894 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:38" (1/1) ... [2025-03-08 09:37:38,905 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:38" (1/1) ... [2025-03-08 09:37:38,912 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:38" (1/1) ... [2025-03-08 09:37:38,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:37:38,925 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:37:38,925 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:37:38,925 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:37:38,926 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:38" (1/1) ... [2025-03-08 09:37:38,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:37:38,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:37:38,953 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 09:37:38,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 09:37:38,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:37:38,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 09:37:38,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:37:38,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:37:39,078 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:37:39,079 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:37:39,715 INFO L? ?]: Removed 395 outVars from TransFormulas that were not future-live. [2025-03-08 09:37:39,715 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:37:39,749 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:37:39,750 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:37:39,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:37:39 BoogieIcfgContainer [2025-03-08 09:37:39,750 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:37:39,754 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:37:39,755 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:37:39,758 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:37:39,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:37:38" (1/3) ... [2025-03-08 09:37:39,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1dec5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:37:39, skipping insertion in model container [2025-03-08 09:37:39,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:38" (2/3) ... [2025-03-08 09:37:39,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1dec5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:37:39, skipping insertion in model container [2025-03-08 09:37:39,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:37:39" (3/3) ... [2025-03-08 09:37:39,760 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p01.c [2025-03-08 09:37:39,770 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:37:39,771 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p01.c that has 1 procedures, 142 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:37:39,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:37:39,864 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;@1843acd5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:37:39,864 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:37:39,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 140 states have (on average 1.4928571428571429) internal successors, (209), 141 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:39,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 09:37:39,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:39,874 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:37:39,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:39,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:39,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1016460869, now seen corresponding path program 1 times [2025-03-08 09:37:39,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:37:39,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631484777] [2025-03-08 09:37:39,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:39,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:37:39,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 09:37:40,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 09:37:40,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:40,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:40,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:37:40,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:37:40,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631484777] [2025-03-08 09:37:40,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631484777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:37:40,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:37:40,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:37:40,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397764435] [2025-03-08 09:37:40,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:37:40,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:37:40,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:37:40,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:37:40,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:37:40,442 INFO L87 Difference]: Start difference. First operand has 142 states, 140 states have (on average 1.4928571428571429) internal successors, (209), 141 states have internal predecessors, (209), 0 states have call successors, (0), 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 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:40,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:37:40,534 INFO L93 Difference]: Finished difference Result 229 states and 339 transitions. [2025-03-08 09:37:40,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:37:40,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-08 09:37:40,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:37:40,541 INFO L225 Difference]: With dead ends: 229 [2025-03-08 09:37:40,541 INFO L226 Difference]: Without dead ends: 141 [2025-03-08 09:37:40,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:37:40,545 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:37:40,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 505 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:37:40,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-08 09:37:40,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-03-08 09:37:40,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.4785714285714286) internal successors, (207), 140 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:40,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 207 transitions. [2025-03-08 09:37:40,574 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 207 transitions. Word has length 41 [2025-03-08 09:37:40,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:37:40,575 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 207 transitions. [2025-03-08 09:37:40,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:40,575 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 207 transitions. [2025-03-08 09:37:40,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 09:37:40,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:40,576 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:37:40,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 09:37:40,576 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:40,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:40,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1440836617, now seen corresponding path program 1 times [2025-03-08 09:37:40,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:37:40,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358408045] [2025-03-08 09:37:40,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:40,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:37:40,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 09:37:40,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 09:37:40,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:40,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:40,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:37:40,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:37:40,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358408045] [2025-03-08 09:37:40,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358408045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:37:40,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:37:40,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:37:40,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566823675] [2025-03-08 09:37:40,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:37:40,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:37:40,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:37:40,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:37:40,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:37:40,723 INFO L87 Difference]: Start difference. First operand 141 states and 207 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:40,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:37:40,823 INFO L93 Difference]: Finished difference Result 230 states and 337 transitions. [2025-03-08 09:37:40,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:37:40,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 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 42 [2025-03-08 09:37:40,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:37:40,825 INFO L225 Difference]: With dead ends: 230 [2025-03-08 09:37:40,825 INFO L226 Difference]: Without dead ends: 143 [2025-03-08 09:37:40,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:37:40,826 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:37:40,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 502 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:37:40,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-08 09:37:40,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-03-08 09:37:40,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.471830985915493) internal successors, (209), 142 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:40,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 209 transitions. [2025-03-08 09:37:40,838 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 209 transitions. Word has length 42 [2025-03-08 09:37:40,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:37:40,838 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 209 transitions. [2025-03-08 09:37:40,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:40,838 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 209 transitions. [2025-03-08 09:37:40,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 09:37:40,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:40,839 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:37:40,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 09:37:40,839 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:40,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:40,840 INFO L85 PathProgramCache]: Analyzing trace with hash 215247158, now seen corresponding path program 1 times [2025-03-08 09:37:40,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:37:40,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662877705] [2025-03-08 09:37:40,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:40,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:37:40,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 09:37:40,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 09:37:40,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:40,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:41,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:37:41,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:37:41,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662877705] [2025-03-08 09:37:41,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662877705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:37:41,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:37:41,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:37:41,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100757490] [2025-03-08 09:37:41,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:37:41,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:37:41,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:37:41,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:37:41,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:37:41,189 INFO L87 Difference]: Start difference. First operand 143 states and 209 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:41,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:37:41,278 INFO L93 Difference]: Finished difference Result 232 states and 338 transitions. [2025-03-08 09:37:41,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:37:41,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-03-08 09:37:41,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:37:41,281 INFO L225 Difference]: With dead ends: 232 [2025-03-08 09:37:41,281 INFO L226 Difference]: Without dead ends: 143 [2025-03-08 09:37:41,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:37:41,283 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 6 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:37:41,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 492 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:37:41,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-08 09:37:41,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-03-08 09:37:41,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.4647887323943662) internal successors, (208), 142 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:41,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 208 transitions. [2025-03-08 09:37:41,293 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 208 transitions. Word has length 43 [2025-03-08 09:37:41,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:37:41,294 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 208 transitions. [2025-03-08 09:37:41,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:41,294 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 208 transitions. [2025-03-08 09:37:41,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 09:37:41,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:41,294 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:37:41,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 09:37:41,295 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:41,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:41,295 INFO L85 PathProgramCache]: Analyzing trace with hash -28910084, now seen corresponding path program 1 times [2025-03-08 09:37:41,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:37:41,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758076177] [2025-03-08 09:37:41,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:41,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:37:41,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 09:37:41,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 09:37:41,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:41,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:41,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:37:41,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:37:41,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758076177] [2025-03-08 09:37:41,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758076177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:37:41,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:37:41,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 09:37:41,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880963159] [2025-03-08 09:37:41,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:37:41,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 09:37:41,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:37:41,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 09:37:41,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 09:37:41,678 INFO L87 Difference]: Start difference. First operand 143 states and 208 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:41,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:37:41,855 INFO L93 Difference]: Finished difference Result 242 states and 350 transitions. [2025-03-08 09:37:41,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 09:37:41,856 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-08 09:37:41,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:37:41,858 INFO L225 Difference]: With dead ends: 242 [2025-03-08 09:37:41,859 INFO L226 Difference]: Without dead ends: 153 [2025-03-08 09:37:41,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-08 09:37:41,861 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 192 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:37:41,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 972 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:37:41,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-08 09:37:41,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2025-03-08 09:37:41,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.4569536423841059) internal successors, (220), 151 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:41,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 220 transitions. [2025-03-08 09:37:41,869 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 220 transitions. Word has length 44 [2025-03-08 09:37:41,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:37:41,870 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 220 transitions. [2025-03-08 09:37:41,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:41,870 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 220 transitions. [2025-03-08 09:37:41,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 09:37:41,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:41,873 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:37:41,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 09:37:41,873 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:41,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:41,873 INFO L85 PathProgramCache]: Analyzing trace with hash 53862060, now seen corresponding path program 1 times [2025-03-08 09:37:41,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:37:41,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391369443] [2025-03-08 09:37:41,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:41,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:37:41,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 09:37:41,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 09:37:41,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:41,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:42,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:37:42,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:37:42,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391369443] [2025-03-08 09:37:42,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391369443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:37:42,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:37:42,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:37:42,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594300587] [2025-03-08 09:37:42,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:37:42,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:37:42,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:37:42,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:37:42,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:37:42,055 INFO L87 Difference]: Start difference. First operand 152 states and 220 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:42,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:37:42,178 INFO L93 Difference]: Finished difference Result 291 states and 415 transitions. [2025-03-08 09:37:42,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:37:42,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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 45 [2025-03-08 09:37:42,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:37:42,179 INFO L225 Difference]: With dead ends: 291 [2025-03-08 09:37:42,180 INFO L226 Difference]: Without dead ends: 193 [2025-03-08 09:37:42,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 09:37:42,181 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 272 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:37:42,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 478 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:37:42,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-08 09:37:42,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 154. [2025-03-08 09:37:42,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.4509803921568627) internal successors, (222), 153 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:42,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 222 transitions. [2025-03-08 09:37:42,190 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 222 transitions. Word has length 45 [2025-03-08 09:37:42,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:37:42,190 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 222 transitions. [2025-03-08 09:37:42,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:42,191 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 222 transitions. [2025-03-08 09:37:42,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 09:37:42,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:42,191 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:37:42,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 09:37:42,191 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:42,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:42,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2057911780, now seen corresponding path program 1 times [2025-03-08 09:37:42,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:37:42,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657601237] [2025-03-08 09:37:42,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:42,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:37:42,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 09:37:42,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 09:37:42,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:42,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:42,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:37:42,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:37:42,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657601237] [2025-03-08 09:37:42,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657601237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:37:42,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:37:42,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 09:37:42,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716374961] [2025-03-08 09:37:42,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:37:42,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 09:37:42,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:37:42,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 09:37:42,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 09:37:42,769 INFO L87 Difference]: Start difference. First operand 154 states and 222 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:43,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:37:43,103 INFO L93 Difference]: Finished difference Result 257 states and 369 transitions. [2025-03-08 09:37:43,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 09:37:43,104 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 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 45 [2025-03-08 09:37:43,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:37:43,104 INFO L225 Difference]: With dead ends: 257 [2025-03-08 09:37:43,104 INFO L226 Difference]: Without dead ends: 159 [2025-03-08 09:37:43,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-08 09:37:43,105 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 196 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 09:37:43,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1184 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 09:37:43,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-08 09:37:43,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2025-03-08 09:37:43,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.4458598726114649) internal successors, (227), 157 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:43,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 227 transitions. [2025-03-08 09:37:43,109 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 227 transitions. Word has length 45 [2025-03-08 09:37:43,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:37:43,110 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 227 transitions. [2025-03-08 09:37:43,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:43,110 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 227 transitions. [2025-03-08 09:37:43,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 09:37:43,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:43,110 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:37:43,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 09:37:43,111 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:43,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:43,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1808075447, now seen corresponding path program 1 times [2025-03-08 09:37:43,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:37:43,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675522693] [2025-03-08 09:37:43,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:43,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:37:43,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 09:37:43,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 09:37:43,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:43,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:43,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:37:43,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:37:43,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675522693] [2025-03-08 09:37:43,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675522693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:37:43,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:37:43,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:37:43,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134963430] [2025-03-08 09:37:43,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:37:43,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:37:43,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:37:43,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:37:43,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:37:43,321 INFO L87 Difference]: Start difference. First operand 158 states and 227 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:43,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:37:43,409 INFO L93 Difference]: Finished difference Result 266 states and 380 transitions. [2025-03-08 09:37:43,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:37:43,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-03-08 09:37:43,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:37:43,411 INFO L225 Difference]: With dead ends: 266 [2025-03-08 09:37:43,411 INFO L226 Difference]: Without dead ends: 164 [2025-03-08 09:37:43,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:37:43,412 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 175 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:37:43,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 492 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:37:43,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-08 09:37:43,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-03-08 09:37:43,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 1.4294478527607362) internal successors, (233), 163 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:43,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2025-03-08 09:37:43,421 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 46 [2025-03-08 09:37:43,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:37:43,421 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2025-03-08 09:37:43,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:43,421 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2025-03-08 09:37:43,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 09:37:43,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:43,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:37:43,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 09:37:43,424 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:43,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:43,424 INFO L85 PathProgramCache]: Analyzing trace with hash -250411732, now seen corresponding path program 1 times [2025-03-08 09:37:43,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:37:43,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106613886] [2025-03-08 09:37:43,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:43,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:37:43,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 09:37:43,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 09:37:43,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:43,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:43,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:37:43,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:37:43,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106613886] [2025-03-08 09:37:43,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106613886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:37:43,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:37:43,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:37:43,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288412172] [2025-03-08 09:37:43,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:37:43,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:37:43,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:37:43,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:37:43,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:37:43,548 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:43,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:37:43,659 INFO L93 Difference]: Finished difference Result 284 states and 397 transitions. [2025-03-08 09:37:43,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:37:43,660 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-03-08 09:37:43,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:37:43,660 INFO L225 Difference]: With dead ends: 284 [2025-03-08 09:37:43,660 INFO L226 Difference]: Without dead ends: 176 [2025-03-08 09:37:43,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 09:37:43,661 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 202 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:37:43,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 475 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:37:43,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-08 09:37:43,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 166. [2025-03-08 09:37:43,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.4242424242424243) internal successors, (235), 165 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 235 transitions. [2025-03-08 09:37:43,665 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 235 transitions. Word has length 47 [2025-03-08 09:37:43,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:37:43,665 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 235 transitions. [2025-03-08 09:37:43,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:43,665 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 235 transitions. [2025-03-08 09:37:43,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 09:37:43,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:43,666 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:37:43,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 09:37:43,666 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:43,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:43,666 INFO L85 PathProgramCache]: Analyzing trace with hash -767472048, now seen corresponding path program 1 times [2025-03-08 09:37:43,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:37:43,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697450185] [2025-03-08 09:37:43,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:43,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:37:43,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 09:37:43,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 09:37:43,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:43,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:44,368 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:37:44,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:37:44,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697450185] [2025-03-08 09:37:44,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697450185] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:37:44,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581767396] [2025-03-08 09:37:44,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:44,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:37:44,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:37:44,371 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:37:44,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 09:37:44,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 09:37:44,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 09:37:44,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:44,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:44,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 09:37:44,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:37:45,078 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:37:45,079 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:37:45,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581767396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:37:45,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 09:37:45,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2025-03-08 09:37:45,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478088400] [2025-03-08 09:37:45,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:37:45,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 09:37:45,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:37:45,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 09:37:45,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-08 09:37:45,081 INFO L87 Difference]: Start difference. First operand 166 states and 235 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:45,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:37:45,776 INFO L93 Difference]: Finished difference Result 379 states and 530 transitions. [2025-03-08 09:37:45,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 09:37:45,776 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-08 09:37:45,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:37:45,778 INFO L225 Difference]: With dead ends: 379 [2025-03-08 09:37:45,778 INFO L226 Difference]: Without dead ends: 271 [2025-03-08 09:37:45,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-08 09:37:45,778 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 111 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 09:37:45,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 787 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 09:37:45,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-08 09:37:45,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 223. [2025-03-08 09:37:45,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.436936936936937) internal successors, (319), 222 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 319 transitions. [2025-03-08 09:37:45,784 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 319 transitions. Word has length 89 [2025-03-08 09:37:45,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:37:45,784 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 319 transitions. [2025-03-08 09:37:45,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:45,784 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 319 transitions. [2025-03-08 09:37:45,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 09:37:45,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:45,785 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:37:45,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 09:37:45,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:37:45,990 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:45,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:45,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1616999459, now seen corresponding path program 1 times [2025-03-08 09:37:45,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:37:45,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782780158] [2025-03-08 09:37:45,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:45,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:37:46,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 09:37:46,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 09:37:46,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:46,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:46,646 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:37:46,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:37:46,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782780158] [2025-03-08 09:37:46,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782780158] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:37:46,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973137568] [2025-03-08 09:37:46,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:46,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:37:46,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:37:46,649 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:37:46,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 09:37:46,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 09:37:46,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 09:37:46,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:46,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:46,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 851 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 09:37:46,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:37:47,341 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:37:47,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:37:47,735 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:37:47,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973137568] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:37:47,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 09:37:47,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 11] total 24 [2025-03-08 09:37:47,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369588734] [2025-03-08 09:37:47,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 09:37:47,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 09:37:47,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:37:47,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 09:37:47,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2025-03-08 09:37:47,738 INFO L87 Difference]: Start difference. First operand 223 states and 319 transitions. Second operand has 24 states, 24 states have (on average 10.166666666666666) internal successors, (244), 24 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:49,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:37:49,633 INFO L93 Difference]: Finished difference Result 683 states and 971 transitions. [2025-03-08 09:37:49,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 09:37:49,633 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 10.166666666666666) internal successors, (244), 24 states have internal predecessors, (244), 0 states have call successors, (0), 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 90 [2025-03-08 09:37:49,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:37:49,635 INFO L225 Difference]: With dead ends: 683 [2025-03-08 09:37:49,635 INFO L226 Difference]: Without dead ends: 518 [2025-03-08 09:37:49,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=452, Invalid=2518, Unknown=0, NotChecked=0, Total=2970 [2025-03-08 09:37:49,637 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 2072 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 2362 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2072 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 2383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:37:49,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2072 Valid, 758 Invalid, 2383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2362 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 09:37:49,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-08 09:37:49,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 375. [2025-03-08 09:37:49,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 374 states have (on average 1.4385026737967914) internal successors, (538), 374 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:49,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 538 transitions. [2025-03-08 09:37:49,652 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 538 transitions. Word has length 90 [2025-03-08 09:37:49,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:37:49,652 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 538 transitions. [2025-03-08 09:37:49,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 10.166666666666666) internal successors, (244), 24 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:49,652 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 538 transitions. [2025-03-08 09:37:49,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 09:37:49,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:49,660 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:37:49,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 09:37:49,861 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,SelfDestructingSolverStorable9 [2025-03-08 09:37:49,861 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:49,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:49,861 INFO L85 PathProgramCache]: Analyzing trace with hash 2106373550, now seen corresponding path program 1 times [2025-03-08 09:37:49,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:37:49,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990773811] [2025-03-08 09:37:49,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:49,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:37:49,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 09:37:50,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 09:37:50,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:50,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:50,443 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:37:50,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:37:50,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990773811] [2025-03-08 09:37:50,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990773811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:37:50,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:37:50,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:37:50,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081209236] [2025-03-08 09:37:50,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:37:50,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:37:50,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:37:50,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:37:50,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:37:50,445 INFO L87 Difference]: Start difference. First operand 375 states and 538 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:50,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:37:50,737 INFO L93 Difference]: Finished difference Result 713 states and 1024 transitions. [2025-03-08 09:37:50,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:37:50,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-03-08 09:37:50,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:37:50,739 INFO L225 Difference]: With dead ends: 713 [2025-03-08 09:37:50,739 INFO L226 Difference]: Without dead ends: 432 [2025-03-08 09:37:50,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 09:37:50,740 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 352 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:37:50,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 379 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:37:50,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-03-08 09:37:50,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 387. [2025-03-08 09:37:50,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 386 states have (on average 1.432642487046632) internal successors, (553), 386 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:50,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 553 transitions. [2025-03-08 09:37:50,751 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 553 transitions. Word has length 91 [2025-03-08 09:37:50,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:37:50,751 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 553 transitions. [2025-03-08 09:37:50,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:50,752 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 553 transitions. [2025-03-08 09:37:50,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 09:37:50,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:50,752 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:37:50,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 09:37:50,753 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:50,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:50,753 INFO L85 PathProgramCache]: Analyzing trace with hash 773119534, now seen corresponding path program 1 times [2025-03-08 09:37:50,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:37:50,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807050115] [2025-03-08 09:37:50,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:50,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:37:50,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 09:37:50,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 09:37:50,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:50,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:51,329 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:37:51,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:37:51,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807050115] [2025-03-08 09:37:51,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807050115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:37:51,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:37:51,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:37:51,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754555636] [2025-03-08 09:37:51,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:37:51,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:37:51,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:37:51,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:37:51,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:37:51,331 INFO L87 Difference]: Start difference. First operand 387 states and 553 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:51,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:37:51,578 INFO L93 Difference]: Finished difference Result 691 states and 989 transitions. [2025-03-08 09:37:51,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:37:51,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-08 09:37:51,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:37:51,580 INFO L225 Difference]: With dead ends: 691 [2025-03-08 09:37:51,580 INFO L226 Difference]: Without dead ends: 408 [2025-03-08 09:37:51,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 09:37:51,581 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 334 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:37:51,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 500 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:37:51,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-08 09:37:51,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 375. [2025-03-08 09:37:51,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 374 states have (on average 1.4304812834224598) internal successors, (535), 374 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:51,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 535 transitions. [2025-03-08 09:37:51,592 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 535 transitions. Word has length 92 [2025-03-08 09:37:51,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:37:51,592 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 535 transitions. [2025-03-08 09:37:51,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:51,592 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 535 transitions. [2025-03-08 09:37:51,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 09:37:51,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:51,593 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:37:51,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 09:37:51,593 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:51,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:51,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1568582533, now seen corresponding path program 1 times [2025-03-08 09:37:51,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:37:51,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172414177] [2025-03-08 09:37:51,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:51,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:37:51,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 09:37:51,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 09:37:51,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:51,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:52,077 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:37:52,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:37:52,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172414177] [2025-03-08 09:37:52,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172414177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:37:52,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:37:52,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:37:52,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190045159] [2025-03-08 09:37:52,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:37:52,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:37:52,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:37:52,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:37:52,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:37:52,079 INFO L87 Difference]: Start difference. First operand 375 states and 535 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:52,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:37:52,305 INFO L93 Difference]: Finished difference Result 681 states and 973 transitions. [2025-03-08 09:37:52,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:37:52,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-08 09:37:52,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:37:52,307 INFO L225 Difference]: With dead ends: 681 [2025-03-08 09:37:52,307 INFO L226 Difference]: Without dead ends: 375 [2025-03-08 09:37:52,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 09:37:52,309 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 213 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:37:52,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 516 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:37:52,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-08 09:37:52,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2025-03-08 09:37:52,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 374 states have (on average 1.427807486631016) internal successors, (534), 374 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:52,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 534 transitions. [2025-03-08 09:37:52,317 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 534 transitions. Word has length 92 [2025-03-08 09:37:52,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:37:52,317 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 534 transitions. [2025-03-08 09:37:52,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:52,317 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 534 transitions. [2025-03-08 09:37:52,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 09:37:52,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:52,318 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:37:52,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 09:37:52,319 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:52,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:52,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1444899795, now seen corresponding path program 1 times [2025-03-08 09:37:52,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:37:52,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673778502] [2025-03-08 09:37:52,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:52,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:37:52,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 09:37:52,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 09:37:52,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:52,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:52,986 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:37:52,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:37:52,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673778502] [2025-03-08 09:37:52,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673778502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:37:52,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:37:52,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:37:52,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118054452] [2025-03-08 09:37:52,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:37:52,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:37:52,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:37:52,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:37:52,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:37:52,988 INFO L87 Difference]: Start difference. First operand 375 states and 534 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:53,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:37:53,246 INFO L93 Difference]: Finished difference Result 679 states and 970 transitions. [2025-03-08 09:37:53,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:37:53,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-03-08 09:37:53,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:37:53,249 INFO L225 Difference]: With dead ends: 679 [2025-03-08 09:37:53,249 INFO L226 Difference]: Without dead ends: 375 [2025-03-08 09:37:53,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:37:53,249 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 195 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:37:53,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 155 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:37:53,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-08 09:37:53,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2025-03-08 09:37:53,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 374 states have (on average 1.4251336898395721) internal successors, (533), 374 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:53,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 533 transitions. [2025-03-08 09:37:53,258 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 533 transitions. Word has length 93 [2025-03-08 09:37:53,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:37:53,259 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 533 transitions. [2025-03-08 09:37:53,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:53,259 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 533 transitions. [2025-03-08 09:37:53,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 09:37:53,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:53,260 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:37:53,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 09:37:53,261 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:53,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:53,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1635634723, now seen corresponding path program 1 times [2025-03-08 09:37:53,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:37:53,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245296538] [2025-03-08 09:37:53,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:53,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:37:53,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 09:37:53,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 09:37:53,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:53,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:54,007 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:37:54,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:37:54,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245296538] [2025-03-08 09:37:54,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245296538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:37:54,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947638431] [2025-03-08 09:37:54,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:54,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:37:54,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:37:54,009 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:37:54,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 09:37:54,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 09:37:54,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 09:37:54,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:54,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:54,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-08 09:37:54,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:37:55,021 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:37:55,022 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:37:55,386 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:37:55,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947638431] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:37:55,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 09:37:55,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 25 [2025-03-08 09:37:55,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001570801] [2025-03-08 09:37:55,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 09:37:55,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 09:37:55,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:37:55,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 09:37:55,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2025-03-08 09:37:55,389 INFO L87 Difference]: Start difference. First operand 375 states and 533 transitions. Second operand has 25 states, 25 states have (on average 10.24) internal successors, (256), 25 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:57,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:37:57,283 INFO L93 Difference]: Finished difference Result 800 states and 1125 transitions. [2025-03-08 09:37:57,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-08 09:37:57,284 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 10.24) internal successors, (256), 25 states have internal predecessors, (256), 0 states have call successors, (0), 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 94 [2025-03-08 09:37:57,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:37:57,288 INFO L225 Difference]: With dead ends: 800 [2025-03-08 09:37:57,288 INFO L226 Difference]: Without dead ends: 573 [2025-03-08 09:37:57,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=446, Invalid=2634, Unknown=0, NotChecked=0, Total=3080 [2025-03-08 09:37:57,289 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 1666 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 2363 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1666 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 2387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:37:57,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1666 Valid, 715 Invalid, 2387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2363 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 09:37:57,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-03-08 09:37:57,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 354. [2025-03-08 09:37:57,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 1.4192634560906516) internal successors, (501), 353 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:57,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 501 transitions. [2025-03-08 09:37:57,299 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 501 transitions. Word has length 94 [2025-03-08 09:37:57,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:37:57,299 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 501 transitions. [2025-03-08 09:37:57,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.24) internal successors, (256), 25 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:57,300 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 501 transitions. [2025-03-08 09:37:57,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 09:37:57,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:57,301 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:37:57,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 09:37:57,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:37:57,502 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:57,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:57,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2076719137, now seen corresponding path program 1 times [2025-03-08 09:37:57,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:37:57,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456656389] [2025-03-08 09:37:57,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:57,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:37:57,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 09:37:57,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 09:37:57,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:57,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:58,331 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:37:58,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:37:58,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456656389] [2025-03-08 09:37:58,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456656389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:37:58,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:37:58,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 09:37:58,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159715184] [2025-03-08 09:37:58,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:37:58,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 09:37:58,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:37:58,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 09:37:58,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 09:37:58,333 INFO L87 Difference]: Start difference. First operand 354 states and 501 transitions. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:58,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:37:58,838 INFO L93 Difference]: Finished difference Result 576 states and 816 transitions. [2025-03-08 09:37:58,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 09:37:58,838 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-03-08 09:37:58,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:37:58,839 INFO L225 Difference]: With dead ends: 576 [2025-03-08 09:37:58,839 INFO L226 Difference]: Without dead ends: 355 [2025-03-08 09:37:58,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-03-08 09:37:58,840 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 269 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 09:37:58,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 701 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:37:58,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-08 09:37:58,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 354. [2025-03-08 09:37:58,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 1.4164305949008498) internal successors, (500), 353 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:58,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 500 transitions. [2025-03-08 09:37:58,847 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 500 transitions. Word has length 96 [2025-03-08 09:37:58,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:37:58,847 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 500 transitions. [2025-03-08 09:37:58,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:58,847 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 500 transitions. [2025-03-08 09:37:58,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 09:37:58,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:58,848 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:37:58,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 09:37:58,848 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:58,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:58,849 INFO L85 PathProgramCache]: Analyzing trace with hash -898907667, now seen corresponding path program 1 times [2025-03-08 09:37:58,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:37:58,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931697361] [2025-03-08 09:37:58,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:58,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:37:58,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 09:37:59,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 09:37:59,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:59,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:59,761 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:37:59,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:37:59,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931697361] [2025-03-08 09:37:59,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931697361] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:37:59,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460179863] [2025-03-08 09:37:59,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:59,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:37:59,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:37:59,764 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:37:59,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 09:37:59,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 09:38:00,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 09:38:00,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:38:00,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:38:00,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-08 09:38:00,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:38:00,408 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:00,408 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:38:00,731 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:00,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460179863] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:38:00,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 09:38:00,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24 [2025-03-08 09:38:00,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581581443] [2025-03-08 09:38:00,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 09:38:00,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 09:38:00,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:38:00,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 09:38:00,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2025-03-08 09:38:00,733 INFO L87 Difference]: Start difference. First operand 354 states and 500 transitions. Second operand has 24 states, 24 states have (on average 10.875) internal successors, (261), 24 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:01,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:38:01,431 INFO L93 Difference]: Finished difference Result 538 states and 756 transitions. [2025-03-08 09:38:01,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 09:38:01,431 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 10.875) internal successors, (261), 24 states have internal predecessors, (261), 0 states have call successors, (0), 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 97 [2025-03-08 09:38:01,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:38:01,432 INFO L225 Difference]: With dead ends: 538 [2025-03-08 09:38:01,432 INFO L226 Difference]: Without dead ends: 315 [2025-03-08 09:38:01,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2025-03-08 09:38:01,433 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 1007 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 1891 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 1893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 09:38:01,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1007 Valid, 582 Invalid, 1893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1891 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 09:38:01,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-03-08 09:38:01,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 305. [2025-03-08 09:38:01,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 1.4078947368421053) internal successors, (428), 304 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:01,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 428 transitions. [2025-03-08 09:38:01,440 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 428 transitions. Word has length 97 [2025-03-08 09:38:01,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:38:01,440 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 428 transitions. [2025-03-08 09:38:01,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 10.875) internal successors, (261), 24 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:01,440 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 428 transitions. [2025-03-08 09:38:01,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 09:38:01,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:38:01,441 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:38:01,450 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-08 09:38:01,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 09:38:01,642 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:38:01,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:38:01,642 INFO L85 PathProgramCache]: Analyzing trace with hash 815448781, now seen corresponding path program 1 times [2025-03-08 09:38:01,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:38:01,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446931489] [2025-03-08 09:38:01,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:38:01,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:38:01,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 09:38:02,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 09:38:02,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:38:02,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:38:02,759 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:02,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:38:02,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446931489] [2025-03-08 09:38:02,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446931489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:38:02,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:38:02,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 09:38:02,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423904816] [2025-03-08 09:38:02,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:38:02,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 09:38:02,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:38:02,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 09:38:02,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-08 09:38:02,760 INFO L87 Difference]: Start difference. First operand 305 states and 428 transitions. Second operand has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:03,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:38:03,256 INFO L93 Difference]: Finished difference Result 815 states and 1158 transitions. [2025-03-08 09:38:03,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 09:38:03,257 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2025-03-08 09:38:03,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:38:03,259 INFO L225 Difference]: With dead ends: 815 [2025-03-08 09:38:03,259 INFO L226 Difference]: Without dead ends: 645 [2025-03-08 09:38:03,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-08 09:38:03,260 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 308 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:38:03,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 474 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1130 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 09:38:03,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-03-08 09:38:03,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 492. [2025-03-08 09:38:03,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 491 states have (on average 1.4093686354378818) internal successors, (692), 491 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:03,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 692 transitions. [2025-03-08 09:38:03,268 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 692 transitions. Word has length 141 [2025-03-08 09:38:03,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:38:03,268 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 692 transitions. [2025-03-08 09:38:03,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:03,268 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 692 transitions. [2025-03-08 09:38:03,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 09:38:03,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:38:03,270 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:38:03,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 09:38:03,270 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:38:03,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:38:03,271 INFO L85 PathProgramCache]: Analyzing trace with hash 891328739, now seen corresponding path program 1 times [2025-03-08 09:38:03,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:38:03,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023274221] [2025-03-08 09:38:03,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:38:03,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:38:03,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 09:38:03,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 09:38:03,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:38:03,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:38:04,513 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 70 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:04,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:38:04,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023274221] [2025-03-08 09:38:04,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023274221] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:38:04,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989396237] [2025-03-08 09:38:04,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:38:04,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:38:04,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:38:04,517 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:38:04,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 09:38:04,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 09:38:05,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 09:38:05,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:38:05,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:38:05,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 1467 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-08 09:38:05,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:38:05,459 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 70 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:05,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:38:06,516 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:06,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989396237] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:38:06,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 09:38:06,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 17] total 34 [2025-03-08 09:38:06,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097981892] [2025-03-08 09:38:06,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 09:38:06,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 09:38:06,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:38:06,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 09:38:06,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=916, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 09:38:06,519 INFO L87 Difference]: Start difference. First operand 492 states and 692 transitions. Second operand has 34 states, 34 states have (on average 11.029411764705882) internal successors, (375), 34 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:09,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:38:09,236 INFO L93 Difference]: Finished difference Result 2640 states and 3702 transitions. [2025-03-08 09:38:09,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-03-08 09:38:09,237 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 11.029411764705882) internal successors, (375), 34 states have internal predecessors, (375), 0 states have call successors, (0), 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 142 [2025-03-08 09:38:09,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:38:09,242 INFO L225 Difference]: With dead ends: 2640 [2025-03-08 09:38:09,242 INFO L226 Difference]: Without dead ends: 2310 [2025-03-08 09:38:09,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2532 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1582, Invalid=8518, Unknown=0, NotChecked=0, Total=10100 [2025-03-08 09:38:09,244 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 2728 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 5015 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2728 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 5038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 5015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 09:38:09,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2728 Valid, 1360 Invalid, 5038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 5015 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 09:38:09,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2025-03-08 09:38:09,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 1094. [2025-03-08 09:38:09,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 1093 states have (on average 1.4071363220494053) internal successors, (1538), 1093 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:09,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1538 transitions. [2025-03-08 09:38:09,262 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1538 transitions. Word has length 142 [2025-03-08 09:38:09,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:38:09,263 INFO L471 AbstractCegarLoop]: Abstraction has 1094 states and 1538 transitions. [2025-03-08 09:38:09,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 11.029411764705882) internal successors, (375), 34 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:09,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1538 transitions. [2025-03-08 09:38:09,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 09:38:09,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:38:09,265 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:38:09,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 09:38:09,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:38:09,466 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:38:09,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:38:09,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1880166965, now seen corresponding path program 1 times [2025-03-08 09:38:09,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:38:09,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844612519] [2025-03-08 09:38:09,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:38:09,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:38:09,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 09:38:10,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 09:38:10,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:38:10,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:38:11,264 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 55 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:11,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:38:11,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844612519] [2025-03-08 09:38:11,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844612519] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:38:11,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520970277] [2025-03-08 09:38:11,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:38:11,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:38:11,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:38:11,267 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:38:11,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 09:38:11,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 09:38:11,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 09:38:11,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:38:11,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:38:11,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 1471 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-03-08 09:38:11,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:38:12,324 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 09:38:12,324 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:38:12,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520970277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:38:12,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 09:38:12,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 20 [2025-03-08 09:38:12,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444951274] [2025-03-08 09:38:12,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:38:12,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 09:38:12,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:38:12,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 09:38:12,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2025-03-08 09:38:12,325 INFO L87 Difference]: Start difference. First operand 1094 states and 1538 transitions. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:12,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:38:12,795 INFO L93 Difference]: Finished difference Result 1969 states and 2769 transitions. [2025-03-08 09:38:12,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 09:38:12,796 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 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 144 [2025-03-08 09:38:12,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:38:12,798 INFO L225 Difference]: With dead ends: 1969 [2025-03-08 09:38:12,798 INFO L226 Difference]: Without dead ends: 1083 [2025-03-08 09:38:12,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2025-03-08 09:38:12,800 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 446 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 09:38:12,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 328 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:38:12,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2025-03-08 09:38:12,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1083. [2025-03-08 09:38:12,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1082 states have (on average 1.4057301293900184) internal successors, (1521), 1082 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:12,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1521 transitions. [2025-03-08 09:38:12,812 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1521 transitions. Word has length 144 [2025-03-08 09:38:12,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:38:12,813 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1521 transitions. [2025-03-08 09:38:12,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:12,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1521 transitions. [2025-03-08 09:38:12,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 09:38:12,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:38:12,815 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:38:12,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 09:38:13,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:38:13,015 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:38:13,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:38:13,016 INFO L85 PathProgramCache]: Analyzing trace with hash 2070163877, now seen corresponding path program 1 times [2025-03-08 09:38:13,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:38:13,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264895294] [2025-03-08 09:38:13,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:38:13,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:38:13,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 09:38:13,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 09:38:13,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:38:13,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:38:14,816 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 55 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:14,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:38:14,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264895294] [2025-03-08 09:38:14,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264895294] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:38:14,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139030032] [2025-03-08 09:38:14,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:38:14,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:38:14,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:38:14,819 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:38:14,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 09:38:15,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 09:38:15,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 09:38:15,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:38:15,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:38:15,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 1473 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-08 09:38:15,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:38:15,805 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:15,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:38:16,192 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 39 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:16,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139030032] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:38:16,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 09:38:16,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 13] total 29 [2025-03-08 09:38:16,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022659616] [2025-03-08 09:38:16,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 09:38:16,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 09:38:16,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:38:16,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 09:38:16,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2025-03-08 09:38:16,193 INFO L87 Difference]: Start difference. First operand 1083 states and 1521 transitions. Second operand has 29 states, 29 states have (on average 12.344827586206897) internal successors, (358), 29 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:17,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:38:17,650 INFO L93 Difference]: Finished difference Result 4896 states and 6839 transitions. [2025-03-08 09:38:17,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-08 09:38:17,651 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 12.344827586206897) internal successors, (358), 29 states have internal predecessors, (358), 0 states have call successors, (0), 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 144 [2025-03-08 09:38:17,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:38:17,659 INFO L225 Difference]: With dead ends: 4896 [2025-03-08 09:38:17,659 INFO L226 Difference]: Without dead ends: 4040 [2025-03-08 09:38:17,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=605, Invalid=3555, Unknown=0, NotChecked=0, Total=4160 [2025-03-08 09:38:17,662 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 1774 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 2737 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1774 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 2748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:38:17,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1774 Valid, 904 Invalid, 2748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2737 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 09:38:17,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4040 states. [2025-03-08 09:38:17,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4040 to 2932. [2025-03-08 09:38:17,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2932 states, 2931 states have (on average 1.4165813715455475) internal successors, (4152), 2931 states have internal predecessors, (4152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:17,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2932 states to 2932 states and 4152 transitions. [2025-03-08 09:38:17,704 INFO L78 Accepts]: Start accepts. Automaton has 2932 states and 4152 transitions. Word has length 144 [2025-03-08 09:38:17,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:38:17,705 INFO L471 AbstractCegarLoop]: Abstraction has 2932 states and 4152 transitions. [2025-03-08 09:38:17,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 12.344827586206897) internal successors, (358), 29 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:17,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2932 states and 4152 transitions. [2025-03-08 09:38:17,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 09:38:17,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:38:17,708 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:38:17,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 09:38:17,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:38:17,910 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:38:17,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:38:17,910 INFO L85 PathProgramCache]: Analyzing trace with hash 857880411, now seen corresponding path program 1 times [2025-03-08 09:38:17,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:38:17,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284673066] [2025-03-08 09:38:17,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:38:17,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:38:17,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 09:38:18,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 09:38:18,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:38:18,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:38:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 09:38:20,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:38:20,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284673066] [2025-03-08 09:38:20,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284673066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:38:20,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:38:20,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:38:20,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555431317] [2025-03-08 09:38:20,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:38:20,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:38:20,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:38:20,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:38:20,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:38:20,149 INFO L87 Difference]: Start difference. First operand 2932 states and 4152 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:20,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:38:20,374 INFO L93 Difference]: Finished difference Result 5622 states and 7968 transitions. [2025-03-08 09:38:20,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:38:20,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2025-03-08 09:38:20,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:38:20,382 INFO L225 Difference]: With dead ends: 5622 [2025-03-08 09:38:20,382 INFO L226 Difference]: Without dead ends: 2907 [2025-03-08 09:38:20,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:38:20,385 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 194 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:38:20,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 157 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:38:20,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2025-03-08 09:38:20,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 2907. [2025-03-08 09:38:20,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2907 states, 2906 states have (on average 1.4160357880247763) internal successors, (4115), 2906 states have internal predecessors, (4115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:20,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2907 states to 2907 states and 4115 transitions. [2025-03-08 09:38:20,432 INFO L78 Accepts]: Start accepts. Automaton has 2907 states and 4115 transitions. Word has length 145 [2025-03-08 09:38:20,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:38:20,432 INFO L471 AbstractCegarLoop]: Abstraction has 2907 states and 4115 transitions. [2025-03-08 09:38:20,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:20,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2907 states and 4115 transitions. [2025-03-08 09:38:20,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 09:38:20,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:38:20,436 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:38:20,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 09:38:20,437 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:38:20,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:38:20,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1140472785, now seen corresponding path program 1 times [2025-03-08 09:38:20,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:38:20,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210349220] [2025-03-08 09:38:20,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:38:20,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:38:20,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 09:38:21,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 09:38:21,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:38:21,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:38:22,525 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 66 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:22,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:38:22,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210349220] [2025-03-08 09:38:22,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210349220] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:38:22,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192784125] [2025-03-08 09:38:22,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:38:22,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:38:22,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:38:22,527 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:38:22,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 09:38:22,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 09:38:23,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 09:38:23,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:38:23,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:38:23,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 1472 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-03-08 09:38:23,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:38:24,301 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 30 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:24,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:38:26,392 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 18 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:26,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192784125] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:38:26,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 09:38:26,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 28, 26] total 64 [2025-03-08 09:38:26,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639919308] [2025-03-08 09:38:26,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 09:38:26,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-03-08 09:38:26,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:38:26,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-03-08 09:38:26,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=3611, Unknown=0, NotChecked=0, Total=4032 [2025-03-08 09:38:26,394 INFO L87 Difference]: Start difference. First operand 2907 states and 4115 transitions. Second operand has 64 states, 64 states have (on average 6.296875) internal successors, (403), 64 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:35,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:38:35,468 INFO L93 Difference]: Finished difference Result 14332 states and 20139 transitions. [2025-03-08 09:38:35,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2025-03-08 09:38:35,469 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 6.296875) internal successors, (403), 64 states have internal predecessors, (403), 0 states have call successors, (0), 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 145 [2025-03-08 09:38:35,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:38:35,490 INFO L225 Difference]: With dead ends: 14332 [2025-03-08 09:38:35,490 INFO L226 Difference]: Without dead ends: 10544 [2025-03-08 09:38:35,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13701 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=4668, Invalid=37974, Unknown=0, NotChecked=0, Total=42642 [2025-03-08 09:38:35,500 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 4777 mSDsluCounter, 2295 mSDsCounter, 0 mSdLazyCounter, 9162 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4777 SdHoareTripleChecker+Valid, 2364 SdHoareTripleChecker+Invalid, 9205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 9162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:38:35,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4777 Valid, 2364 Invalid, 9205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 9162 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-08 09:38:35,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10544 states. [2025-03-08 09:38:35,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10544 to 5688. [2025-03-08 09:38:35,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5688 states, 5687 states have (on average 1.4005626868296115) internal successors, (7965), 5687 states have internal predecessors, (7965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:35,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5688 states to 5688 states and 7965 transitions. [2025-03-08 09:38:35,597 INFO L78 Accepts]: Start accepts. Automaton has 5688 states and 7965 transitions. Word has length 145 [2025-03-08 09:38:35,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:38:35,597 INFO L471 AbstractCegarLoop]: Abstraction has 5688 states and 7965 transitions. [2025-03-08 09:38:35,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 6.296875) internal successors, (403), 64 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:35,597 INFO L276 IsEmpty]: Start isEmpty. Operand 5688 states and 7965 transitions. [2025-03-08 09:38:35,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 09:38:35,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:38:35,603 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:38:35,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 09:38:35,803 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,SelfDestructingSolverStorable22 [2025-03-08 09:38:35,803 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:38:35,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:38:35,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1257905984, now seen corresponding path program 1 times [2025-03-08 09:38:35,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:38:35,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727842463] [2025-03-08 09:38:35,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:38:35,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:38:35,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 09:38:36,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 09:38:36,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:38:36,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:38:36,895 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 66 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:36,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:38:36,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727842463] [2025-03-08 09:38:36,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727842463] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:38:36,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974921349] [2025-03-08 09:38:36,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:38:36,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:38:36,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:38:36,898 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:38:36,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 09:38:37,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 09:38:37,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 09:38:37,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:38:37,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:38:37,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 1476 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-08 09:38:37,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:38:37,742 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:37,742 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:38:37,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974921349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:38:37,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 09:38:37,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 13 [2025-03-08 09:38:37,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681429723] [2025-03-08 09:38:37,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:38:37,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:38:37,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:38:37,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:38:37,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-08 09:38:37,743 INFO L87 Difference]: Start difference. First operand 5688 states and 7965 transitions. Second operand has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:38,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:38:38,184 INFO L93 Difference]: Finished difference Result 14027 states and 19675 transitions. [2025-03-08 09:38:38,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 09:38:38,184 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2025-03-08 09:38:38,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:38:38,196 INFO L225 Difference]: With dead ends: 14027 [2025-03-08 09:38:38,196 INFO L226 Difference]: Without dead ends: 8682 [2025-03-08 09:38:38,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-08 09:38:38,202 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 215 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 09:38:38,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 366 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 09:38:38,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8682 states. [2025-03-08 09:38:38,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8682 to 8590. [2025-03-08 09:38:38,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8590 states, 8589 states have (on average 1.398300151356386) internal successors, (12010), 8589 states have internal predecessors, (12010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:38,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8590 states to 8590 states and 12010 transitions. [2025-03-08 09:38:38,336 INFO L78 Accepts]: Start accepts. Automaton has 8590 states and 12010 transitions. Word has length 145 [2025-03-08 09:38:38,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:38:38,336 INFO L471 AbstractCegarLoop]: Abstraction has 8590 states and 12010 transitions. [2025-03-08 09:38:38,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:38,336 INFO L276 IsEmpty]: Start isEmpty. Operand 8590 states and 12010 transitions. [2025-03-08 09:38:38,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 09:38:38,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:38:38,343 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:38:38,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 09:38:38,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-08 09:38:38,544 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:38:38,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:38:38,545 INFO L85 PathProgramCache]: Analyzing trace with hash 385383909, now seen corresponding path program 1 times [2025-03-08 09:38:38,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:38:38,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19548734] [2025-03-08 09:38:38,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:38:38,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:38:38,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 09:38:39,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 09:38:39,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:38:39,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:38:40,578 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 53 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:40,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:38:40,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19548734] [2025-03-08 09:38:40,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19548734] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:38:40,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244924648] [2025-03-08 09:38:40,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:38:40,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:38:40,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:38:40,580 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:38:40,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 09:38:41,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 09:38:41,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 09:38:41,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:38:41,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:38:41,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 1475 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-08 09:38:41,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:38:41,817 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:41,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:38:42,409 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 50 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:42,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244924648] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:38:42,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 09:38:42,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20, 16] total 45 [2025-03-08 09:38:42,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888152353] [2025-03-08 09:38:42,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 09:38:42,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-08 09:38:42,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:38:42,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-08 09:38:42,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1747, Unknown=0, NotChecked=0, Total=1980 [2025-03-08 09:38:42,411 INFO L87 Difference]: Start difference. First operand 8590 states and 12010 transitions. Second operand has 45 states, 45 states have (on average 8.733333333333333) internal successors, (393), 45 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:44,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:38:44,835 INFO L93 Difference]: Finished difference Result 27371 states and 38295 transitions. [2025-03-08 09:38:44,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-08 09:38:44,835 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 8.733333333333333) internal successors, (393), 45 states have internal predecessors, (393), 0 states have call successors, (0), 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 146 [2025-03-08 09:38:44,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:38:44,865 INFO L225 Difference]: With dead ends: 27371 [2025-03-08 09:38:44,865 INFO L226 Difference]: Without dead ends: 18523 [2025-03-08 09:38:44,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 276 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2114 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=996, Invalid=7014, Unknown=0, NotChecked=0, Total=8010 [2025-03-08 09:38:44,878 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 1701 mSDsluCounter, 1498 mSDsCounter, 0 mSdLazyCounter, 4719 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1701 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 4735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 4719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:38:44,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1701 Valid, 1551 Invalid, 4735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 4719 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 09:38:44,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18523 states. [2025-03-08 09:38:45,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18523 to 14280. [2025-03-08 09:38:45,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14280 states, 14279 states have (on average 1.4066811401358639) internal successors, (20086), 14279 states have internal predecessors, (20086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:45,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14280 states to 14280 states and 20086 transitions. [2025-03-08 09:38:45,137 INFO L78 Accepts]: Start accepts. Automaton has 14280 states and 20086 transitions. Word has length 146 [2025-03-08 09:38:45,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:38:45,137 INFO L471 AbstractCegarLoop]: Abstraction has 14280 states and 20086 transitions. [2025-03-08 09:38:45,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 8.733333333333333) internal successors, (393), 45 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:45,138 INFO L276 IsEmpty]: Start isEmpty. Operand 14280 states and 20086 transitions. [2025-03-08 09:38:45,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 09:38:45,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:38:45,147 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:38:45,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 09:38:45,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-08 09:38:45,348 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:38:45,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:38:45,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1652448264, now seen corresponding path program 1 times [2025-03-08 09:38:45,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:38:45,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391355991] [2025-03-08 09:38:45,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:38:45,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:38:45,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 09:38:45,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 09:38:45,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:38:45,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:38:46,219 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 09:38:46,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:38:46,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391355991] [2025-03-08 09:38:46,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391355991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:38:46,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:38:46,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:38:46,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613434319] [2025-03-08 09:38:46,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:38:46,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:38:46,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:38:46,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:38:46,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:38:46,220 INFO L87 Difference]: Start difference. First operand 14280 states and 20086 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:46,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:38:46,553 INFO L93 Difference]: Finished difference Result 25733 states and 36329 transitions. [2025-03-08 09:38:46,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:38:46,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2025-03-08 09:38:46,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:38:46,568 INFO L225 Difference]: With dead ends: 25733 [2025-03-08 09:38:46,568 INFO L226 Difference]: Without dead ends: 11559 [2025-03-08 09:38:46,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:38:46,582 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 214 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:38:46,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 162 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:38:46,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11559 states. [2025-03-08 09:38:46,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11559 to 11358. [2025-03-08 09:38:46,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11358 states, 11357 states have (on average 1.3920049308796336) internal successors, (15809), 11357 states have internal predecessors, (15809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:46,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11358 states to 11358 states and 15809 transitions. [2025-03-08 09:38:46,743 INFO L78 Accepts]: Start accepts. Automaton has 11358 states and 15809 transitions. Word has length 146 [2025-03-08 09:38:46,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:38:46,743 INFO L471 AbstractCegarLoop]: Abstraction has 11358 states and 15809 transitions. [2025-03-08 09:38:46,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:46,743 INFO L276 IsEmpty]: Start isEmpty. Operand 11358 states and 15809 transitions. [2025-03-08 09:38:46,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 09:38:46,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:38:46,746 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:38:46,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 09:38:46,747 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:38:46,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:38:46,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1581748097, now seen corresponding path program 1 times [2025-03-08 09:38:46,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:38:46,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026179580] [2025-03-08 09:38:46,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:38:46,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:38:46,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 09:38:47,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 09:38:47,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:38:47,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:38:47,586 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 09:38:47,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:38:47,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026179580] [2025-03-08 09:38:47,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026179580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:38:47,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:38:47,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 09:38:47,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306935494] [2025-03-08 09:38:47,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:38:47,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 09:38:47,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:38:47,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 09:38:47,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:38:47,587 INFO L87 Difference]: Start difference. First operand 11358 states and 15809 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:47,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:38:47,846 INFO L93 Difference]: Finished difference Result 22631 states and 31502 transitions. [2025-03-08 09:38:47,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 09:38:47,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 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 146 [2025-03-08 09:38:47,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:38:47,858 INFO L225 Difference]: With dead ends: 22631 [2025-03-08 09:38:47,858 INFO L226 Difference]: Without dead ends: 11379 [2025-03-08 09:38:47,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:38:47,868 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 256 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:38:47,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 159 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:38:47,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11379 states. [2025-03-08 09:38:47,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11379 to 11379. [2025-03-08 09:38:47,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11379 states, 11378 states have (on average 1.3917208648268589) internal successors, (15835), 11378 states have internal predecessors, (15835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:47,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11379 states to 11379 states and 15835 transitions. [2025-03-08 09:38:48,000 INFO L78 Accepts]: Start accepts. Automaton has 11379 states and 15835 transitions. Word has length 146 [2025-03-08 09:38:48,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:38:48,000 INFO L471 AbstractCegarLoop]: Abstraction has 11379 states and 15835 transitions. [2025-03-08 09:38:48,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:48,000 INFO L276 IsEmpty]: Start isEmpty. Operand 11379 states and 15835 transitions. [2025-03-08 09:38:48,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-08 09:38:48,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:38:48,006 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:38:48,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 09:38:48,006 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:38:48,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:38:48,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1169852866, now seen corresponding path program 1 times [2025-03-08 09:38:48,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:38:48,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830790279] [2025-03-08 09:38:48,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:38:48,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:38:48,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 09:38:48,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 09:38:48,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:38:48,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:38:49,439 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 169 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 09:38:49,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:38:49,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830790279] [2025-03-08 09:38:49,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830790279] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:38:49,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863850156] [2025-03-08 09:38:49,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:38:49,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:38:49,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:38:49,441 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:38:49,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 09:38:49,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 09:38:50,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 09:38:50,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:38:50,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:38:50,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 2083 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-03-08 09:38:50,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:38:50,616 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 129 proven. 21 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 09:38:50,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:38:51,393 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 138 proven. 27 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 09:38:51,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863850156] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:38:51,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 09:38:51,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 15] total 31 [2025-03-08 09:38:51,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492647007] [2025-03-08 09:38:51,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 09:38:51,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 09:38:51,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:38:51,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 09:38:51,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2025-03-08 09:38:51,395 INFO L87 Difference]: Start difference. First operand 11379 states and 15835 transitions. Second operand has 31 states, 31 states have (on average 16.35483870967742) internal successors, (507), 31 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:55,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:38:55,871 INFO L93 Difference]: Finished difference Result 47236 states and 65763 transitions. [2025-03-08 09:38:55,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-03-08 09:38:55,872 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 16.35483870967742) internal successors, (507), 31 states have internal predecessors, (507), 0 states have call successors, (0), 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 192 [2025-03-08 09:38:55,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:38:55,907 INFO L225 Difference]: With dead ends: 47236 [2025-03-08 09:38:55,907 INFO L226 Difference]: Without dead ends: 34418 [2025-03-08 09:38:55,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1760 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=842, Invalid=6640, Unknown=0, NotChecked=0, Total=7482 [2025-03-08 09:38:55,925 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 680 mSDsluCounter, 3906 mSDsCounter, 0 mSdLazyCounter, 11120 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 4119 SdHoareTripleChecker+Invalid, 11125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-08 09:38:55,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 4119 Invalid, 11125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11120 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-08 09:38:55,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34418 states. [2025-03-08 09:38:56,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34418 to 25732. [2025-03-08 09:38:56,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25732 states, 25731 states have (on average 1.3882087754070964) internal successors, (35720), 25731 states have internal predecessors, (35720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:56,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25732 states to 25732 states and 35720 transitions. [2025-03-08 09:38:56,274 INFO L78 Accepts]: Start accepts. Automaton has 25732 states and 35720 transitions. Word has length 192 [2025-03-08 09:38:56,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:38:56,274 INFO L471 AbstractCegarLoop]: Abstraction has 25732 states and 35720 transitions. [2025-03-08 09:38:56,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 16.35483870967742) internal successors, (507), 31 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:56,275 INFO L276 IsEmpty]: Start isEmpty. Operand 25732 states and 35720 transitions. [2025-03-08 09:38:56,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-08 09:38:56,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:38:56,291 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:38:56,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 09:38:56,492 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,SelfDestructingSolverStorable27 [2025-03-08 09:38:56,492 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:38:56,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:38:56,493 INFO L85 PathProgramCache]: Analyzing trace with hash 456994557, now seen corresponding path program 1 times [2025-03-08 09:38:56,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:38:56,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745452624] [2025-03-08 09:38:56,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:38:56,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:38:56,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 09:38:58,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 09:38:58,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:38:58,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat