./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b0406e617bfcdc7e6543e19b38e9be8eeb37f2896cb91bcfe6035d747328da7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:11:10,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:11:10,550 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:11:10,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:11:10,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:11:10,583 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:11:10,584 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:11:10,584 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:11:10,584 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:11:10,584 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:11:10,584 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:11:10,585 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:11:10,585 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:11:10,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:11:10,585 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:11:10,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:11:10,585 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:11:10,585 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:11:10,586 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:11:10,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:11:10,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:11:10,586 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:11:10,586 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:11:10,586 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:11:10,586 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:11:10,586 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:11:10,586 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:11:10,586 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:11:10,586 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:11:10,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:11:10,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:11:10,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:11:10,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:11:10,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:11:10,586 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:11:10,586 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:11:10,586 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:11:10,587 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:11:10,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:11:10,587 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:11:10,587 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:11:10,587 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:11:10,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:11:10,587 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8b0406e617bfcdc7e6543e19b38e9be8eeb37f2896cb91bcfe6035d747328da7 [2025-02-05 16:11:10,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:11:10,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:11:10,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:11:10,865 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:11:10,865 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:11:10,866 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2025-02-05 16:11:12,134 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8def4ec4f/bd9111a031c243b988abf190d2c8eb7c/FLAG0f44fc57b [2025-02-05 16:11:12,441 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:11:12,441 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2025-02-05 16:11:12,453 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8def4ec4f/bd9111a031c243b988abf190d2c8eb7c/FLAG0f44fc57b [2025-02-05 16:11:12,714 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8def4ec4f/bd9111a031c243b988abf190d2c8eb7c [2025-02-05 16:11:12,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:11:12,717 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:11:12,718 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:11:12,718 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:11:12,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:11:12,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:11:12" (1/1) ... [2025-02-05 16:11:12,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a274b47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:12, skipping insertion in model container [2025-02-05 16:11:12,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:11:12" (1/1) ... [2025-02-05 16:11:12,736 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:11:12,884 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c[11348,11361] [2025-02-05 16:11:12,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:11:12,899 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:11:12,949 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c[11348,11361] [2025-02-05 16:11:12,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:11:12,969 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:11:12,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:12 WrapperNode [2025-02-05 16:11:12,971 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:11:12,972 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:11:12,972 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:11:12,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:11:12,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:12" (1/1) ... [2025-02-05 16:11:12,988 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:12" (1/1) ... [2025-02-05 16:11:13,023 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 437 [2025-02-05 16:11:13,024 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:11:13,024 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:11:13,024 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:11:13,025 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:11:13,033 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:12" (1/1) ... [2025-02-05 16:11:13,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:12" (1/1) ... [2025-02-05 16:11:13,036 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:12" (1/1) ... [2025-02-05 16:11:13,060 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-02-05 16:11:13,061 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:12" (1/1) ... [2025-02-05 16:11:13,061 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:12" (1/1) ... [2025-02-05 16:11:13,070 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:12" (1/1) ... [2025-02-05 16:11:13,071 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:12" (1/1) ... [2025-02-05 16:11:13,072 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:12" (1/1) ... [2025-02-05 16:11:13,076 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:12" (1/1) ... [2025-02-05 16:11:13,078 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:11:13,079 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:11:13,082 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:11:13,082 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:11:13,083 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:12" (1/1) ... [2025-02-05 16:11:13,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:11:13,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:11:13,109 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:11:13,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:11:13,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:11:13,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:11:13,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:11:13,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:11:13,221 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:11:13,223 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:11:13,599 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-02-05 16:11:13,599 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:11:13,608 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:11:13,608 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:11:13,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:11:13 BoogieIcfgContainer [2025-02-05 16:11:13,609 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:11:13,610 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:11:13,610 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:11:13,613 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:11:13,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:11:12" (1/3) ... [2025-02-05 16:11:13,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149e6043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:11:13, skipping insertion in model container [2025-02-05 16:11:13,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:12" (2/3) ... [2025-02-05 16:11:13,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149e6043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:11:13, skipping insertion in model container [2025-02-05 16:11:13,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:11:13" (3/3) ... [2025-02-05 16:11:13,614 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2025-02-05 16:11:13,623 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:11:13,625 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.3.1.ufo.BOUNDED-6.pals.c that has 1 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 16:11:13,667 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:11:13,678 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;@2e44ac4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:11:13,678 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:11:13,681 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 110 states have (on average 1.7727272727272727) internal successors, (195), 111 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:13,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 16:11:13,687 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:11:13,687 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] [2025-02-05 16:11:13,688 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:11:13,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:11:13,692 INFO L85 PathProgramCache]: Analyzing trace with hash 415871078, now seen corresponding path program 1 times [2025-02-05 16:11:13,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:11:13,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609433838] [2025-02-05 16:11:13,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:13,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:11:13,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 16:11:13,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 16:11:13,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:13,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:13,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:11:13,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:11:13,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609433838] [2025-02-05 16:11:13,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609433838] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:11:13,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:11:13,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 16:11:13,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856958391] [2025-02-05 16:11:13,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:11:13,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 16:11:13,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:11:13,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 16:11:13,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:11:13,962 INFO L87 Difference]: Start difference. First operand has 112 states, 110 states have (on average 1.7727272727272727) internal successors, (195), 111 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:13,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:11:13,983 INFO L93 Difference]: Finished difference Result 174 states and 300 transitions. [2025-02-05 16:11:13,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 16:11:13,984 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-02-05 16:11:13,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:11:13,992 INFO L225 Difference]: With dead ends: 174 [2025-02-05 16:11:13,992 INFO L226 Difference]: Without dead ends: 109 [2025-02-05 16:11:13,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:11:13,999 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:11:13,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:11:14,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-05 16:11:14,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-02-05 16:11:14,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.7592592592592593) internal successors, (190), 108 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:14,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 190 transitions. [2025-02-05 16:11:14,020 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 190 transitions. Word has length 37 [2025-02-05 16:11:14,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:11:14,020 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 190 transitions. [2025-02-05 16:11:14,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:14,021 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 190 transitions. [2025-02-05 16:11:14,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 16:11:14,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:11:14,021 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] [2025-02-05 16:11:14,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:11:14,022 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:11:14,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:11:14,022 INFO L85 PathProgramCache]: Analyzing trace with hash 7046853, now seen corresponding path program 1 times [2025-02-05 16:11:14,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:11:14,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506670732] [2025-02-05 16:11:14,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:14,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:11:14,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 16:11:14,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 16:11:14,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:14,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:14,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:11:14,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:11:14,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506670732] [2025-02-05 16:11:14,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506670732] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:11:14,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:11:14,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:11:14,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708316981] [2025-02-05 16:11:14,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:11:14,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:11:14,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:11:14,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:11:14,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:11:14,250 INFO L87 Difference]: Start difference. First operand 109 states and 190 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:14,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:11:14,324 INFO L93 Difference]: Finished difference Result 229 states and 394 transitions. [2025-02-05 16:11:14,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:11:14,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-02-05 16:11:14,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:11:14,328 INFO L225 Difference]: With dead ends: 229 [2025-02-05 16:11:14,328 INFO L226 Difference]: Without dead ends: 167 [2025-02-05 16:11:14,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:11:14,329 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 99 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:11:14,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 717 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:11:14,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-02-05 16:11:14,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 109. [2025-02-05 16:11:14,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.5648148148148149) internal successors, (169), 108 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:14,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 169 transitions. [2025-02-05 16:11:14,339 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 169 transitions. Word has length 37 [2025-02-05 16:11:14,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:11:14,339 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 169 transitions. [2025-02-05 16:11:14,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:14,339 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 169 transitions. [2025-02-05 16:11:14,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 16:11:14,341 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:11:14,341 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:11:14,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:11:14,341 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:11:14,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:11:14,342 INFO L85 PathProgramCache]: Analyzing trace with hash 277192369, now seen corresponding path program 1 times [2025-02-05 16:11:14,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:11:14,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667195823] [2025-02-05 16:11:14,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:14,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:11:14,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 16:11:14,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 16:11:14,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:14,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:14,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:11:14,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:11:14,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667195823] [2025-02-05 16:11:14,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667195823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:11:14,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:11:14,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:11:14,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058698407] [2025-02-05 16:11:14,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:11:14,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:11:14,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:11:14,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:11:14,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:11:14,450 INFO L87 Difference]: Start difference. First operand 109 states and 169 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:14,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:11:14,481 INFO L93 Difference]: Finished difference Result 216 states and 352 transitions. [2025-02-05 16:11:14,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:11:14,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-02-05 16:11:14,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:11:14,482 INFO L225 Difference]: With dead ends: 216 [2025-02-05 16:11:14,483 INFO L226 Difference]: Without dead ends: 158 [2025-02-05 16:11:14,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:11:14,483 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 75 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:11:14,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 367 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:11:14,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-05 16:11:14,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2025-02-05 16:11:14,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.5870967741935484) internal successors, (246), 155 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:14,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 246 transitions. [2025-02-05 16:11:14,490 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 246 transitions. Word has length 57 [2025-02-05 16:11:14,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:11:14,492 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 246 transitions. [2025-02-05 16:11:14,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:14,493 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 246 transitions. [2025-02-05 16:11:14,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 16:11:14,493 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:11:14,494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:11:14,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:11:14,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:11:14,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:11:14,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1983005401, now seen corresponding path program 1 times [2025-02-05 16:11:14,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:11:14,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045847873] [2025-02-05 16:11:14,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:14,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:11:14,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 16:11:14,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 16:11:14,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:14,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:14,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:11:14,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:11:14,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045847873] [2025-02-05 16:11:14,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045847873] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:11:14,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:11:14,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:11:14,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295469792] [2025-02-05 16:11:14,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:11:14,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:11:14,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:11:14,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:11:14,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:11:14,553 INFO L87 Difference]: Start difference. First operand 156 states and 246 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:14,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:11:14,567 INFO L93 Difference]: Finished difference Result 263 states and 429 transitions. [2025-02-05 16:11:14,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:11:14,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-02-05 16:11:14,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:11:14,568 INFO L225 Difference]: With dead ends: 263 [2025-02-05 16:11:14,568 INFO L226 Difference]: Without dead ends: 205 [2025-02-05 16:11:14,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:11:14,569 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 84 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:11:14,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 387 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:11:14,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-05 16:11:14,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2025-02-05 16:11:14,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 1.613861386138614) internal successors, (326), 202 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:14,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 326 transitions. [2025-02-05 16:11:14,577 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 326 transitions. Word has length 59 [2025-02-05 16:11:14,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:11:14,577 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 326 transitions. [2025-02-05 16:11:14,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:14,578 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 326 transitions. [2025-02-05 16:11:14,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 16:11:14,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:11:14,579 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:11:14,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:11:14,579 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:11:14,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:11:14,579 INFO L85 PathProgramCache]: Analyzing trace with hash -933552076, now seen corresponding path program 1 times [2025-02-05 16:11:14,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:11:14,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260781944] [2025-02-05 16:11:14,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:14,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:11:14,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 16:11:14,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 16:11:14,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:14,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:14,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:11:14,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:11:14,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260781944] [2025-02-05 16:11:14,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260781944] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:11:14,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:11:14,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:11:14,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355640330] [2025-02-05 16:11:14,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:11:14,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:11:14,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:11:14,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:11:14,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:11:14,642 INFO L87 Difference]: Start difference. First operand 203 states and 326 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:14,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:11:14,666 INFO L93 Difference]: Finished difference Result 482 states and 797 transitions. [2025-02-05 16:11:14,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:11:14,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-02-05 16:11:14,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:11:14,667 INFO L225 Difference]: With dead ends: 482 [2025-02-05 16:11:14,667 INFO L226 Difference]: Without dead ends: 332 [2025-02-05 16:11:14,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:11:14,668 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 77 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:11:14,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 320 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:11:14,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-02-05 16:11:14,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2025-02-05 16:11:14,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 329 states have (on average 1.635258358662614) internal successors, (538), 329 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-02-05 16:11:14,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 538 transitions. [2025-02-05 16:11:14,678 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 538 transitions. Word has length 59 [2025-02-05 16:11:14,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:11:14,679 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 538 transitions. [2025-02-05 16:11:14,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:14,679 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 538 transitions. [2025-02-05 16:11:14,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 16:11:14,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:11:14,680 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:11:14,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:11:14,680 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:11:14,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:11:14,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1119665814, now seen corresponding path program 1 times [2025-02-05 16:11:14,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:11:14,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194811756] [2025-02-05 16:11:14,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:14,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:11:14,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 16:11:14,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 16:11:14,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:14,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:14,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:11:14,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:11:14,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194811756] [2025-02-05 16:11:14,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194811756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:11:14,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:11:14,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:11:14,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831629916] [2025-02-05 16:11:14,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:11:14,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:11:14,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:11:14,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:11:14,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:11:14,742 INFO L87 Difference]: Start difference. First operand 330 states and 538 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:14,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:11:14,762 INFO L93 Difference]: Finished difference Result 842 states and 1394 transitions. [2025-02-05 16:11:14,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:11:14,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-02-05 16:11:14,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:11:14,764 INFO L225 Difference]: With dead ends: 842 [2025-02-05 16:11:14,764 INFO L226 Difference]: Without dead ends: 565 [2025-02-05 16:11:14,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:11:14,765 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 71 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:11:14,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 359 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:11:14,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-02-05 16:11:14,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 563. [2025-02-05 16:11:14,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 562 states have (on average 1.6370106761565837) internal successors, (920), 562 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:14,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 920 transitions. [2025-02-05 16:11:14,779 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 920 transitions. Word has length 61 [2025-02-05 16:11:14,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:11:14,780 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 920 transitions. [2025-02-05 16:11:14,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:14,780 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 920 transitions. [2025-02-05 16:11:14,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:11:14,781 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:11:14,781 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:11:14,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:11:14,781 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:11:14,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:11:14,781 INFO L85 PathProgramCache]: Analyzing trace with hash 934269772, now seen corresponding path program 1 times [2025-02-05 16:11:14,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:11:14,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974430839] [2025-02-05 16:11:14,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:14,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:11:14,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:11:14,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:11:14,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:14,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:14,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:11:14,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:11:14,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974430839] [2025-02-05 16:11:14,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974430839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:11:14,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:11:14,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:11:14,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634413009] [2025-02-05 16:11:14,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:11:14,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:11:14,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:11:14,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:11:14,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:11:14,836 INFO L87 Difference]: Start difference. First operand 563 states and 920 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:14,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:11:14,853 INFO L93 Difference]: Finished difference Result 1072 states and 1768 transitions. [2025-02-05 16:11:14,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:11:14,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-02-05 16:11:14,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:11:14,856 INFO L225 Difference]: With dead ends: 1072 [2025-02-05 16:11:14,856 INFO L226 Difference]: Without dead ends: 795 [2025-02-05 16:11:14,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:11:14,857 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 72 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:11:14,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 358 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:11:14,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2025-02-05 16:11:14,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 793. [2025-02-05 16:11:14,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 792 states have (on average 1.6313131313131313) internal successors, (1292), 792 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:14,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1292 transitions. [2025-02-05 16:11:14,872 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1292 transitions. Word has length 63 [2025-02-05 16:11:14,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:11:14,873 INFO L471 AbstractCegarLoop]: Abstraction has 793 states and 1292 transitions. [2025-02-05 16:11:14,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:14,873 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1292 transitions. [2025-02-05 16:11:14,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:11:14,873 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:11:14,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:11:14,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:11:14,874 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:11:14,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:11:14,874 INFO L85 PathProgramCache]: Analyzing trace with hash 511939417, now seen corresponding path program 1 times [2025-02-05 16:11:14,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:11:14,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513743306] [2025-02-05 16:11:14,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:14,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:11:14,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:11:14,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:11:14,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:14,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:14,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:11:14,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:11:14,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513743306] [2025-02-05 16:11:14,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513743306] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:11:14,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:11:14,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:11:14,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023933067] [2025-02-05 16:11:14,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:11:14,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:11:14,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:11:14,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:11:14,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:11:14,980 INFO L87 Difference]: Start difference. First operand 793 states and 1292 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:15,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:11:15,108 INFO L93 Difference]: Finished difference Result 3745 states and 6250 transitions. [2025-02-05 16:11:15,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:11:15,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-02-05 16:11:15,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:11:15,117 INFO L225 Difference]: With dead ends: 3745 [2025-02-05 16:11:15,117 INFO L226 Difference]: Without dead ends: 3026 [2025-02-05 16:11:15,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:11:15,118 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 618 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:11:15,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 861 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:11:15,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3026 states. [2025-02-05 16:11:15,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3026 to 1460. [2025-02-05 16:11:15,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1460 states, 1459 states have (on average 1.630568882796436) internal successors, (2379), 1459 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:15,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2379 transitions. [2025-02-05 16:11:15,153 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2379 transitions. Word has length 63 [2025-02-05 16:11:15,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:11:15,154 INFO L471 AbstractCegarLoop]: Abstraction has 1460 states and 2379 transitions. [2025-02-05 16:11:15,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:15,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2379 transitions. [2025-02-05 16:11:15,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:11:15,155 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:11:15,155 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:11:15,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:11:15,155 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:11:15,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:11:15,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1258892062, now seen corresponding path program 1 times [2025-02-05 16:11:15,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:11:15,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722640975] [2025-02-05 16:11:15,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:15,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:11:15,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:11:15,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:11:15,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:15,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:15,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:11:15,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:11:15,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722640975] [2025-02-05 16:11:15,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722640975] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:11:15,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:11:15,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:11:15,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452077705] [2025-02-05 16:11:15,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:11:15,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:11:15,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:11:15,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:11:15,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:11:15,237 INFO L87 Difference]: Start difference. First operand 1460 states and 2379 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:15,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:11:15,315 INFO L93 Difference]: Finished difference Result 4669 states and 7716 transitions. [2025-02-05 16:11:15,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:11:15,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-02-05 16:11:15,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:11:15,324 INFO L225 Difference]: With dead ends: 4669 [2025-02-05 16:11:15,324 INFO L226 Difference]: Without dead ends: 3286 [2025-02-05 16:11:15,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:11:15,326 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 284 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:11:15,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 531 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:11:15,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3286 states. [2025-02-05 16:11:15,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3286 to 2360. [2025-02-05 16:11:15,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2360 states, 2359 states have (on average 1.6341670199236964) internal successors, (3855), 2359 states have internal predecessors, (3855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:15,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2360 states to 2360 states and 3855 transitions. [2025-02-05 16:11:15,393 INFO L78 Accepts]: Start accepts. Automaton has 2360 states and 3855 transitions. Word has length 64 [2025-02-05 16:11:15,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:11:15,394 INFO L471 AbstractCegarLoop]: Abstraction has 2360 states and 3855 transitions. [2025-02-05 16:11:15,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:15,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 3855 transitions. [2025-02-05 16:11:15,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:11:15,394 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:11:15,395 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:11:15,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:11:15,395 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:11:15,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:11:15,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1022165855, now seen corresponding path program 1 times [2025-02-05 16:11:15,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:11:15,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208219637] [2025-02-05 16:11:15,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:15,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:11:15,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:11:15,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:11:15,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:15,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:15,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:11:15,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:11:15,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208219637] [2025-02-05 16:11:15,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208219637] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:11:15,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:11:15,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:11:15,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410913562] [2025-02-05 16:11:15,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:11:15,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:11:15,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:11:15,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:11:15,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:11:15,448 INFO L87 Difference]: Start difference. First operand 2360 states and 3855 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:15,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:11:15,501 INFO L93 Difference]: Finished difference Result 4626 states and 7585 transitions. [2025-02-05 16:11:15,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:11:15,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-02-05 16:11:15,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:11:15,511 INFO L225 Difference]: With dead ends: 4626 [2025-02-05 16:11:15,511 INFO L226 Difference]: Without dead ends: 3316 [2025-02-05 16:11:15,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:11:15,513 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 78 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:11:15,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 388 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:11:15,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3316 states. [2025-02-05 16:11:15,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3316 to 3314. [2025-02-05 16:11:15,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3314 states, 3313 states have (on average 1.620887413220646) internal successors, (5370), 3313 states have internal predecessors, (5370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:15,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3314 states to 3314 states and 5370 transitions. [2025-02-05 16:11:15,580 INFO L78 Accepts]: Start accepts. Automaton has 3314 states and 5370 transitions. Word has length 64 [2025-02-05 16:11:15,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:11:15,580 INFO L471 AbstractCegarLoop]: Abstraction has 3314 states and 5370 transitions. [2025-02-05 16:11:15,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:15,580 INFO L276 IsEmpty]: Start isEmpty. Operand 3314 states and 5370 transitions. [2025-02-05 16:11:15,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:11:15,581 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:11:15,581 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:11:15,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:11:15,581 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:11:15,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:11:15,582 INFO L85 PathProgramCache]: Analyzing trace with hash -321940105, now seen corresponding path program 1 times [2025-02-05 16:11:15,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:11:15,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103430450] [2025-02-05 16:11:15,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:15,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:11:15,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:11:15,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:11:15,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:15,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:15,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:11:15,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:11:15,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103430450] [2025-02-05 16:11:15,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103430450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:11:15,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:11:15,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:11:15,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765006895] [2025-02-05 16:11:15,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:11:15,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:11:15,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:11:15,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:11:15,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:11:15,661 INFO L87 Difference]: Start difference. First operand 3314 states and 5370 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:15,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:11:15,784 INFO L93 Difference]: Finished difference Result 10669 states and 17369 transitions. [2025-02-05 16:11:15,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:11:15,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-05 16:11:15,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:11:15,805 INFO L225 Difference]: With dead ends: 10669 [2025-02-05 16:11:15,805 INFO L226 Difference]: Without dead ends: 7420 [2025-02-05 16:11:15,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:11:15,810 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 282 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:11:15,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 533 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:11:15,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7420 states. [2025-02-05 16:11:15,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7420 to 5338. [2025-02-05 16:11:15,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5338 states, 5337 states have (on average 1.609893198426082) internal successors, (8592), 5337 states have internal predecessors, (8592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:15,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5338 states to 5338 states and 8592 transitions. [2025-02-05 16:11:15,969 INFO L78 Accepts]: Start accepts. Automaton has 5338 states and 8592 transitions. Word has length 65 [2025-02-05 16:11:15,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:11:15,969 INFO L471 AbstractCegarLoop]: Abstraction has 5338 states and 8592 transitions. [2025-02-05 16:11:15,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:15,969 INFO L276 IsEmpty]: Start isEmpty. Operand 5338 states and 8592 transitions. [2025-02-05 16:11:15,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:11:15,970 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:11:15,970 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:11:15,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:11:15,970 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:11:15,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:11:15,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1343047552, now seen corresponding path program 1 times [2025-02-05 16:11:15,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:11:15,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468278823] [2025-02-05 16:11:15,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:15,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:11:15,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:11:15,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:11:15,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:15,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:11:16,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:11:16,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468278823] [2025-02-05 16:11:16,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468278823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:11:16,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:11:16,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:11:16,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78195992] [2025-02-05 16:11:16,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:11:16,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:11:16,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:11:16,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:11:16,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:11:16,033 INFO L87 Difference]: Start difference. First operand 5338 states and 8592 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:16,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:11:16,245 INFO L93 Difference]: Finished difference Result 16865 states and 27249 transitions. [2025-02-05 16:11:16,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:11:16,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-05 16:11:16,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:11:16,279 INFO L225 Difference]: With dead ends: 16865 [2025-02-05 16:11:16,280 INFO L226 Difference]: Without dead ends: 11592 [2025-02-05 16:11:16,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:11:16,288 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 280 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:11:16,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 535 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:11:16,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11592 states. [2025-02-05 16:11:16,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11592 to 8422. [2025-02-05 16:11:16,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8422 states, 8421 states have (on average 1.598622491390571) internal successors, (13462), 8421 states have internal predecessors, (13462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:16,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8422 states to 8422 states and 13462 transitions. [2025-02-05 16:11:16,527 INFO L78 Accepts]: Start accepts. Automaton has 8422 states and 13462 transitions. Word has length 66 [2025-02-05 16:11:16,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:11:16,528 INFO L471 AbstractCegarLoop]: Abstraction has 8422 states and 13462 transitions. [2025-02-05 16:11:16,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:16,528 INFO L276 IsEmpty]: Start isEmpty. Operand 8422 states and 13462 transitions. [2025-02-05 16:11:16,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:11:16,528 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:11:16,528 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:11:16,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:11:16,528 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:11:16,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:11:16,529 INFO L85 PathProgramCache]: Analyzing trace with hash -730305506, now seen corresponding path program 1 times [2025-02-05 16:11:16,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:11:16,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688384792] [2025-02-05 16:11:16,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:16,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:11:16,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:11:16,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:11:16,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:16,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:16,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:11:16,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:11:16,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688384792] [2025-02-05 16:11:16,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688384792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:11:16,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:11:16,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:11:16,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659237905] [2025-02-05 16:11:16,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:11:16,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:11:16,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:11:16,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:11:16,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:11:16,728 INFO L87 Difference]: Start difference. First operand 8422 states and 13462 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:16,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:11:16,917 INFO L93 Difference]: Finished difference Result 16781 states and 26838 transitions. [2025-02-05 16:11:16,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:11:16,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-02-05 16:11:16,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:11:16,933 INFO L225 Difference]: With dead ends: 16781 [2025-02-05 16:11:16,934 INFO L226 Difference]: Without dead ends: 8424 [2025-02-05 16:11:16,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:11:16,944 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 211 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:11:16,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 442 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:11:16,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8424 states. [2025-02-05 16:11:17,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8424 to 8422. [2025-02-05 16:11:17,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8422 states, 8421 states have (on average 1.583778648616554) internal successors, (13337), 8421 states have internal predecessors, (13337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:17,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8422 states to 8422 states and 13337 transitions. [2025-02-05 16:11:17,132 INFO L78 Accepts]: Start accepts. Automaton has 8422 states and 13337 transitions. Word has length 68 [2025-02-05 16:11:17,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:11:17,132 INFO L471 AbstractCegarLoop]: Abstraction has 8422 states and 13337 transitions. [2025-02-05 16:11:17,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:17,133 INFO L276 IsEmpty]: Start isEmpty. Operand 8422 states and 13337 transitions. [2025-02-05 16:11:17,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-05 16:11:17,133 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:11:17,133 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, 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-02-05 16:11:17,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:11:17,133 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:11:17,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:11:17,135 INFO L85 PathProgramCache]: Analyzing trace with hash -855596976, now seen corresponding path program 1 times [2025-02-05 16:11:17,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:11:17,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316511418] [2025-02-05 16:11:17,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:17,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:11:17,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 16:11:17,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 16:11:17,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:17,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:17,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:11:17,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:11:17,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316511418] [2025-02-05 16:11:17,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316511418] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:11:17,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:11:17,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:11:17,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851027738] [2025-02-05 16:11:17,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:11:17,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:11:17,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:11:17,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:11:17,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:11:17,289 INFO L87 Difference]: Start difference. First operand 8422 states and 13337 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:17,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:11:17,501 INFO L93 Difference]: Finished difference Result 24139 states and 38372 transitions. [2025-02-05 16:11:17,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:11:17,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-02-05 16:11:17,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:11:17,525 INFO L225 Difference]: With dead ends: 24139 [2025-02-05 16:11:17,525 INFO L226 Difference]: Without dead ends: 15782 [2025-02-05 16:11:17,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:11:17,535 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 137 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:11:17,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 447 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:11:17,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15782 states. [2025-02-05 16:11:17,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15782 to 15780. [2025-02-05 16:11:17,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15780 states, 15779 states have (on average 1.5673997084732874) internal successors, (24732), 15779 states have internal predecessors, (24732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:17,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15780 states to 15780 states and 24732 transitions. [2025-02-05 16:11:17,928 INFO L78 Accepts]: Start accepts. Automaton has 15780 states and 24732 transitions. Word has length 71 [2025-02-05 16:11:17,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:11:17,928 INFO L471 AbstractCegarLoop]: Abstraction has 15780 states and 24732 transitions. [2025-02-05 16:11:17,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:17,929 INFO L276 IsEmpty]: Start isEmpty. Operand 15780 states and 24732 transitions. [2025-02-05 16:11:17,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-05 16:11:17,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:11:17,930 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, 1, 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-02-05 16:11:17,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:11:17,930 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:11:17,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:11:17,931 INFO L85 PathProgramCache]: Analyzing trace with hash -721317705, now seen corresponding path program 1 times [2025-02-05 16:11:17,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:11:17,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667360550] [2025-02-05 16:11:17,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:17,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:11:17,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 16:11:17,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 16:11:17,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:17,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:18,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:11:18,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:11:18,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667360550] [2025-02-05 16:11:18,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667360550] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:11:18,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:11:18,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:11:18,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638731715] [2025-02-05 16:11:18,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:11:18,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:11:18,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:11:18,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:11:18,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:11:18,133 INFO L87 Difference]: Start difference. First operand 15780 states and 24732 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:18,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:11:18,367 INFO L93 Difference]: Finished difference Result 16868 states and 26181 transitions. [2025-02-05 16:11:18,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:11:18,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2025-02-05 16:11:18,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:11:18,398 INFO L225 Difference]: With dead ends: 16868 [2025-02-05 16:11:18,399 INFO L226 Difference]: Without dead ends: 16866 [2025-02-05 16:11:18,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:11:18,406 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:11:18,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 650 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:11:18,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16866 states. [2025-02-05 16:11:18,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16866 to 16866. [2025-02-05 16:11:18,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16866 states, 16865 states have (on average 1.5303290839015713) internal successors, (25809), 16865 states have internal predecessors, (25809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:18,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16866 states to 16866 states and 25809 transitions. [2025-02-05 16:11:18,758 INFO L78 Accepts]: Start accepts. Automaton has 16866 states and 25809 transitions. Word has length 72 [2025-02-05 16:11:18,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:11:18,758 INFO L471 AbstractCegarLoop]: Abstraction has 16866 states and 25809 transitions. [2025-02-05 16:11:18,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:18,759 INFO L276 IsEmpty]: Start isEmpty. Operand 16866 states and 25809 transitions. [2025-02-05 16:11:18,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:11:18,761 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:11:18,761 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:11:18,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:11:18,761 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:11:18,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:11:18,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1626415896, now seen corresponding path program 1 times [2025-02-05 16:11:18,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:11:18,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767867954] [2025-02-05 16:11:18,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:18,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:11:18,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:11:18,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:11:18,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:18,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:18,838 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:11:18,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:11:18,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767867954] [2025-02-05 16:11:18,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767867954] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:11:18,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:11:18,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:11:18,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582214325] [2025-02-05 16:11:18,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:11:18,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:11:18,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:11:18,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:11:18,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:11:18,840 INFO L87 Difference]: Start difference. First operand 16866 states and 25809 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:19,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:11:19,140 INFO L93 Difference]: Finished difference Result 50343 states and 76963 transitions. [2025-02-05 16:11:19,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:11:19,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-02-05 16:11:19,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:11:19,194 INFO L225 Difference]: With dead ends: 50343 [2025-02-05 16:11:19,195 INFO L226 Difference]: Without dead ends: 33538 [2025-02-05 16:11:19,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:11:19,214 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 105 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:11:19,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 382 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:11:19,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33538 states. [2025-02-05 16:11:19,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33538 to 33536. [2025-02-05 16:11:19,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33536 states, 33535 states have (on average 1.5152825406291934) internal successors, (50815), 33535 states have internal predecessors, (50815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:19,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33536 states to 33536 states and 50815 transitions. [2025-02-05 16:11:19,765 INFO L78 Accepts]: Start accepts. Automaton has 33536 states and 50815 transitions. Word has length 97 [2025-02-05 16:11:19,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:11:19,765 INFO L471 AbstractCegarLoop]: Abstraction has 33536 states and 50815 transitions. [2025-02-05 16:11:19,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:19,765 INFO L276 IsEmpty]: Start isEmpty. Operand 33536 states and 50815 transitions. [2025-02-05 16:11:19,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:11:19,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:11:19,771 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:11:19,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:11:19,771 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:11:19,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:11:19,772 INFO L85 PathProgramCache]: Analyzing trace with hash -888716505, now seen corresponding path program 1 times [2025-02-05 16:11:19,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:11:19,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667033422] [2025-02-05 16:11:19,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:19,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:11:19,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:11:19,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:11:19,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:19,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:19,828 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:11:19,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:11:19,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667033422] [2025-02-05 16:11:19,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667033422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:11:19,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:11:19,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:11:19,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986004745] [2025-02-05 16:11:19,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:11:19,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:11:19,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:11:19,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:11:19,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:11:19,830 INFO L87 Difference]: Start difference. First operand 33536 states and 50815 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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-02-05 16:11:20,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:11:20,328 INFO L93 Difference]: Finished difference Result 100154 states and 151608 transitions. [2025-02-05 16:11:20,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:11:20,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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 97 [2025-02-05 16:11:20,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:11:20,448 INFO L225 Difference]: With dead ends: 100154 [2025-02-05 16:11:20,448 INFO L226 Difference]: Without dead ends: 66709 [2025-02-05 16:11:20,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:11:20,477 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 104 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:11:20,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 383 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:11:20,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66709 states. [2025-02-05 16:11:21,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66709 to 66707. [2025-02-05 16:11:21,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66707 states, 66706 states have (on average 1.5001349203969658) internal successors, (100068), 66706 states have internal predecessors, (100068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:21,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66707 states to 66707 states and 100068 transitions. [2025-02-05 16:11:21,984 INFO L78 Accepts]: Start accepts. Automaton has 66707 states and 100068 transitions. Word has length 97 [2025-02-05 16:11:21,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:11:21,984 INFO L471 AbstractCegarLoop]: Abstraction has 66707 states and 100068 transitions. [2025-02-05 16:11:21,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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-02-05 16:11:21,984 INFO L276 IsEmpty]: Start isEmpty. Operand 66707 states and 100068 transitions. [2025-02-05 16:11:21,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:11:21,989 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:11:21,989 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:11:21,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:11:21,989 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:11:21,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:11:21,990 INFO L85 PathProgramCache]: Analyzing trace with hash 124221238, now seen corresponding path program 1 times [2025-02-05 16:11:21,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:11:21,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132970544] [2025-02-05 16:11:21,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:21,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:11:21,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:11:22,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:11:22,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:22,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:22,065 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:11:22,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:11:22,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132970544] [2025-02-05 16:11:22,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132970544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:11:22,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:11:22,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:11:22,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770210757] [2025-02-05 16:11:22,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:11:22,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:11:22,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:11:22,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:11:22,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:11:22,067 INFO L87 Difference]: Start difference. First operand 66707 states and 100068 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:23,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:11:23,136 INFO L93 Difference]: Finished difference Result 199227 states and 298554 transitions. [2025-02-05 16:11:23,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:11:23,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-02-05 16:11:23,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:11:23,370 INFO L225 Difference]: With dead ends: 199227 [2025-02-05 16:11:23,371 INFO L226 Difference]: Without dead ends: 132681 [2025-02-05 16:11:23,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:11:23,411 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 90 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:11:23,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 368 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:11:23,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132681 states. [2025-02-05 16:11:25,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132681 to 132679. [2025-02-05 16:11:25,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132679 states, 132678 states have (on average 1.4847977810940773) internal successors, (197000), 132678 states have internal predecessors, (197000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:25,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132679 states to 132679 states and 197000 transitions. [2025-02-05 16:11:25,663 INFO L78 Accepts]: Start accepts. Automaton has 132679 states and 197000 transitions. Word has length 97 [2025-02-05 16:11:25,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:11:25,664 INFO L471 AbstractCegarLoop]: Abstraction has 132679 states and 197000 transitions. [2025-02-05 16:11:25,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:25,664 INFO L276 IsEmpty]: Start isEmpty. Operand 132679 states and 197000 transitions. [2025-02-05 16:11:25,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:11:25,672 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:11:25,672 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:11:25,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:11:25,673 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:11:25,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:11:25,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1196326182, now seen corresponding path program 1 times [2025-02-05 16:11:25,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:11:25,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496489132] [2025-02-05 16:11:25,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:25,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:11:25,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:11:25,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:11:25,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:25,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:25,722 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:11:25,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:11:25,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496489132] [2025-02-05 16:11:25,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496489132] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:11:25,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:11:25,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:11:25,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979063597] [2025-02-05 16:11:25,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:11:25,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:11:25,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:11:25,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:11:25,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:11:25,723 INFO L87 Difference]: Start difference. First operand 132679 states and 197000 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:28,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:11:28,225 INFO L93 Difference]: Finished difference Result 396279 states and 587799 transitions. [2025-02-05 16:11:28,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:11:28,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-02-05 16:11:28,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:11:28,826 INFO L225 Difference]: With dead ends: 396279 [2025-02-05 16:11:28,826 INFO L226 Difference]: Without dead ends: 263961 [2025-02-05 16:11:28,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:11:28,955 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 124 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:11:28,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 399 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:11:29,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263961 states. [2025-02-05 16:11:33,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263961 to 263959. [2025-02-05 16:11:33,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263959 states, 263958 states have (on average 1.4693890694731737) internal successors, (387857), 263958 states have internal predecessors, (387857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:34,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263959 states to 263959 states and 387857 transitions. [2025-02-05 16:11:34,651 INFO L78 Accepts]: Start accepts. Automaton has 263959 states and 387857 transitions. Word has length 97 [2025-02-05 16:11:34,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:11:34,652 INFO L471 AbstractCegarLoop]: Abstraction has 263959 states and 387857 transitions. [2025-02-05 16:11:34,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:34,652 INFO L276 IsEmpty]: Start isEmpty. Operand 263959 states and 387857 transitions. [2025-02-05 16:11:34,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:11:34,677 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:11:34,677 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:11:34,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:11:34,678 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:11:34,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:11:34,678 INFO L85 PathProgramCache]: Analyzing trace with hash 747629543, now seen corresponding path program 1 times [2025-02-05 16:11:34,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:11:34,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504812487] [2025-02-05 16:11:34,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:34,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:11:34,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:11:34,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:11:34,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:34,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:34,750 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:11:34,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:11:34,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504812487] [2025-02-05 16:11:34,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504812487] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:11:34,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:11:34,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:11:34,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593006195] [2025-02-05 16:11:34,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:11:34,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:11:34,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:11:34,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:11:34,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:11:34,752 INFO L87 Difference]: Start difference. First operand 263959 states and 387857 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:37,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:11:37,769 INFO L93 Difference]: Finished difference Result 396615 states and 581467 transitions. [2025-02-05 16:11:37,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:11:37,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-02-05 16:11:37,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:11:38,300 INFO L225 Difference]: With dead ends: 396615 [2025-02-05 16:11:38,300 INFO L226 Difference]: Without dead ends: 264265 [2025-02-05 16:11:38,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:11:38,377 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 95 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:11:38,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 430 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:11:38,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264265 states. [2025-02-05 16:11:42,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264265 to 264263. [2025-02-05 16:11:43,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264263 states, 264262 states have (on average 1.4562403977870446) internal successors, (384829), 264262 states have internal predecessors, (384829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:43,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264263 states to 264263 states and 384829 transitions. [2025-02-05 16:11:43,899 INFO L78 Accepts]: Start accepts. Automaton has 264263 states and 384829 transitions. Word has length 97 [2025-02-05 16:11:43,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:11:43,899 INFO L471 AbstractCegarLoop]: Abstraction has 264263 states and 384829 transitions. [2025-02-05 16:11:43,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:11:43,900 INFO L276 IsEmpty]: Start isEmpty. Operand 264263 states and 384829 transitions. [2025-02-05 16:11:43,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:11:43,915 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:11:43,915 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:11:43,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:11:43,916 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:11:43,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:11:43,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2039785944, now seen corresponding path program 1 times [2025-02-05 16:11:43,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:11:43,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930016798] [2025-02-05 16:11:43,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:11:43,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:11:43,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:11:43,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:11:43,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:11:43,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:11:43,996 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:11:43,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:11:43,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930016798] [2025-02-05 16:11:43,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930016798] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:11:43,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:11:43,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:11:43,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654896570] [2025-02-05 16:11:43,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:11:43,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:11:44,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:11:44,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:11:44,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:11:44,001 INFO L87 Difference]: Start difference. First operand 264263 states and 384829 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)