./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.8_overflow.ufo.UNBOUNDED.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_lcr.8_overflow.ufo.UNBOUNDED.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 55ec916898aa0c4eb40269e81429fc0273ca07ec4caf7be0cd441cce0028ad79 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:18:16,644 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:18:16,720 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:18:16,726 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:18:16,726 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:18:16,765 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:18:16,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:18:16,766 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:18:16,767 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:18:16,767 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:18:16,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:18:16,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:18:16,769 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:18:16,769 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:18:16,769 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:18:16,769 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:18:16,769 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:18:16,769 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:18:16,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:18:16,769 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:18:16,769 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:18:16,769 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:18:16,769 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:18:16,769 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:18:16,770 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:18:16,770 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:18:16,770 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:18:16,770 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:18:16,770 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:18:16,770 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:18:16,770 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:18:16,770 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:18:16,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:18:16,770 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:18:16,770 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:18:16,770 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:18:16,771 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:18:16,771 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:18:16,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:18:16,771 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:18:16,771 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:18:16,771 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:18:16,771 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:18:16,771 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 -> 55ec916898aa0c4eb40269e81429fc0273ca07ec4caf7be0cd441cce0028ad79 [2025-02-05 16:18:17,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:18:17,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:18:17,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:18:17,062 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:18:17,063 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:18:17,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c [2025-02-05 16:18:18,343 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/70279db21/233eb0b7aec84bbe886681c5ba8f796a/FLAG0bcace112 [2025-02-05 16:18:18,625 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:18:18,626 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c [2025-02-05 16:18:18,643 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/70279db21/233eb0b7aec84bbe886681c5ba8f796a/FLAG0bcace112 [2025-02-05 16:18:18,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/70279db21/233eb0b7aec84bbe886681c5ba8f796a [2025-02-05 16:18:18,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:18:18,665 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:18:18,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:18:18,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:18:18,670 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:18:18,671 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:18:18" (1/1) ... [2025-02-05 16:18:18,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@185f26f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:18, skipping insertion in model container [2025-02-05 16:18:18,672 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:18:18" (1/1) ... [2025-02-05 16:18:18,700 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:18:18,964 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_lcr.8_overflow.ufo.UNBOUNDED.pals.c[26555,26568] [2025-02-05 16:18:18,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:18:18,986 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:18:19,068 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_lcr.8_overflow.ufo.UNBOUNDED.pals.c[26555,26568] [2025-02-05 16:18:19,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:18:19,089 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:18:19,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:19 WrapperNode [2025-02-05 16:18:19,090 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:18:19,091 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:18:19,091 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:18:19,091 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:18:19,098 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:18:19" (1/1) ... [2025-02-05 16:18:19,111 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:18:19" (1/1) ... [2025-02-05 16:18:19,156 INFO L138 Inliner]: procedures = 28, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 525 [2025-02-05 16:18:19,157 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:18:19,157 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:18:19,157 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:18:19,158 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:18:19,168 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:19" (1/1) ... [2025-02-05 16:18:19,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:19" (1/1) ... [2025-02-05 16:18:19,177 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:19" (1/1) ... [2025-02-05 16:18:19,204 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:18:19,204 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:19" (1/1) ... [2025-02-05 16:18:19,204 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:19" (1/1) ... [2025-02-05 16:18:19,221 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:19" (1/1) ... [2025-02-05 16:18:19,223 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:19" (1/1) ... [2025-02-05 16:18:19,229 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:19" (1/1) ... [2025-02-05 16:18:19,231 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:19" (1/1) ... [2025-02-05 16:18:19,234 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:18:19,235 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:18:19,235 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:18:19,235 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:18:19,237 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:19" (1/1) ... [2025-02-05 16:18:19,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:18:19,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:18:19,277 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:18:19,284 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:18:19,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:18:19,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:18:19,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:18:19,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:18:19,436 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:18:19,438 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:18:19,959 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-02-05 16:18:19,959 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:18:19,970 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:18:19,971 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:18:19,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:18:19 BoogieIcfgContainer [2025-02-05 16:18:19,971 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:18:19,974 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:18:19,974 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:18:19,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:18:19,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:18:18" (1/3) ... [2025-02-05 16:18:19,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9c30a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:18:19, skipping insertion in model container [2025-02-05 16:18:19,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:19" (2/3) ... [2025-02-05 16:18:19,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9c30a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:18:19, skipping insertion in model container [2025-02-05 16:18:19,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:18:19" (3/3) ... [2025-02-05 16:18:19,982 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c [2025-02-05 16:18:19,996 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:18:19,999 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c that has 1 procedures, 130 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 16:18:20,052 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:18:20,084 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;@6d0a4bbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:18:20,084 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:18:20,088 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 128 states have (on average 1.796875) internal successors, (230), 129 states have internal predecessors, (230), 0 states have call successors, (0), 0 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:18:20,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 16:18:20,094 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:18:20,095 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] [2025-02-05 16:18:20,095 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:18:20,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:18:20,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1616186147, now seen corresponding path program 1 times [2025-02-05 16:18:20,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:18:20,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978466395] [2025-02-05 16:18:20,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:18:20,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:18:20,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 16:18:20,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 16:18:20,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:18:20,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:18:20,415 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:18:20,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:18:20,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978466395] [2025-02-05 16:18:20,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978466395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:18:20,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:18:20,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 16:18:20,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239716539] [2025-02-05 16:18:20,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:18:20,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 16:18:20,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:18:20,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 16:18:20,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:18:20,444 INFO L87 Difference]: Start difference. First operand has 130 states, 128 states have (on average 1.796875) internal successors, (230), 129 states have internal predecessors, (230), 0 states have call successors, (0), 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 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:20,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:18:20,463 INFO L93 Difference]: Finished difference Result 191 states and 330 transitions. [2025-02-05 16:18:20,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 16:18:20,465 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-05 16:18:20,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:18:20,472 INFO L225 Difference]: With dead ends: 191 [2025-02-05 16:18:20,472 INFO L226 Difference]: Without dead ends: 127 [2025-02-05 16:18:20,475 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:18:20,477 INFO L435 NwaCegarLoop]: 225 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, 225 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:18:20,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:18:20,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-05 16:18:20,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-02-05 16:18:20,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.7857142857142858) internal successors, (225), 126 states have internal predecessors, (225), 0 states have call successors, (0), 0 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:18:20,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 225 transitions. [2025-02-05 16:18:20,513 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 225 transitions. Word has length 29 [2025-02-05 16:18:20,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:18:20,513 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 225 transitions. [2025-02-05 16:18:20,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:20,514 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 225 transitions. [2025-02-05 16:18:20,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 16:18:20,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:18:20,515 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] [2025-02-05 16:18:20,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:18:20,516 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:18:20,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:18:20,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1683192900, now seen corresponding path program 1 times [2025-02-05 16:18:20,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:18:20,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677472862] [2025-02-05 16:18:20,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:18:20,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:18:20,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 16:18:20,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 16:18:20,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:18:20,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:18:20,862 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:18:20,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:18:20,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677472862] [2025-02-05 16:18:20,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677472862] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:18:20,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:18:20,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:18:20,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916141107] [2025-02-05 16:18:20,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:18:20,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:18:20,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:18:20,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:18:20,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:18:20,866 INFO L87 Difference]: Start difference. First operand 127 states and 225 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:21,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:18:21,015 INFO L93 Difference]: Finished difference Result 191 states and 326 transitions. [2025-02-05 16:18:21,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:18:21,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-05 16:18:21,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:18:21,019 INFO L225 Difference]: With dead ends: 191 [2025-02-05 16:18:21,020 INFO L226 Difference]: Without dead ends: 127 [2025-02-05 16:18:21,021 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:18:21,022 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 0 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:18:21,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 826 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:18:21,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-05 16:18:21,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-02-05 16:18:21,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.3015873015873016) internal successors, (164), 126 states have internal predecessors, (164), 0 states have call successors, (0), 0 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:18:21,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 164 transitions. [2025-02-05 16:18:21,030 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 164 transitions. Word has length 29 [2025-02-05 16:18:21,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:18:21,030 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 164 transitions. [2025-02-05 16:18:21,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:21,030 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 164 transitions. [2025-02-05 16:18:21,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 16:18:21,032 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:18:21,032 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:18:21,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:18:21,033 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:18:21,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:18:21,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1940804992, now seen corresponding path program 1 times [2025-02-05 16:18:21,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:18:21,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058471179] [2025-02-05 16:18:21,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:18:21,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:18:21,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 16:18:21,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 16:18:21,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:18:21,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:18:21,562 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:18:21,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:18:21,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058471179] [2025-02-05 16:18:21,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058471179] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:18:21,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:18:21,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 16:18:21,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482812672] [2025-02-05 16:18:21,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:18:21,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:18:21,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:18:21,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:18:21,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:18:21,565 INFO L87 Difference]: Start difference. First operand 127 states and 164 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:22,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:18:22,268 INFO L93 Difference]: Finished difference Result 1087 states and 1716 transitions. [2025-02-05 16:18:22,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 16:18:22,269 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-02-05 16:18:22,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:18:22,276 INFO L225 Difference]: With dead ends: 1087 [2025-02-05 16:18:22,277 INFO L226 Difference]: Without dead ends: 1027 [2025-02-05 16:18:22,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2025-02-05 16:18:22,279 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 1777 mSDsluCounter, 5496 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1777 SdHoareTripleChecker+Valid, 5656 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:18:22,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1777 Valid, 5656 Invalid, 421 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [11 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:18:22,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2025-02-05 16:18:22,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 185. [2025-02-05 16:18:22,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.4021739130434783) internal successors, (258), 184 states have internal predecessors, (258), 0 states have call successors, (0), 0 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:18:22,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 258 transitions. [2025-02-05 16:18:22,315 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 258 transitions. Word has length 89 [2025-02-05 16:18:22,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:18:22,316 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 258 transitions. [2025-02-05 16:18:22,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:22,316 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 258 transitions. [2025-02-05 16:18:22,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 16:18:22,321 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:18:22,321 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:18:22,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:18:22,321 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:18:22,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:18:22,322 INFO L85 PathProgramCache]: Analyzing trace with hash 22562363, now seen corresponding path program 1 times [2025-02-05 16:18:22,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:18:22,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921379458] [2025-02-05 16:18:22,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:18:22,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:18:22,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 16:18:22,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 16:18:22,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:18:22,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:18:22,529 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:18:22,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:18:22,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921379458] [2025-02-05 16:18:22,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921379458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:18:22,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:18:22,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:18:22,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364619377] [2025-02-05 16:18:22,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:18:22,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:18:22,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:18:22,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:18:22,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:18:22,531 INFO L87 Difference]: Start difference. First operand 185 states and 258 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:22,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:18:22,558 INFO L93 Difference]: Finished difference Result 410 states and 621 transitions. [2025-02-05 16:18:22,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:18:22,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-02-05 16:18:22,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:18:22,561 INFO L225 Difference]: With dead ends: 410 [2025-02-05 16:18:22,561 INFO L226 Difference]: Without dead ends: 292 [2025-02-05 16:18:22,561 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:18:22,562 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 67 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:18:22,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 254 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:18:22,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-02-05 16:18:22,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 290. [2025-02-05 16:18:22,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 1.4740484429065743) internal successors, (426), 289 states have internal predecessors, (426), 0 states have call successors, (0), 0 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:18:22,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 426 transitions. [2025-02-05 16:18:22,575 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 426 transitions. Word has length 91 [2025-02-05 16:18:22,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:18:22,575 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 426 transitions. [2025-02-05 16:18:22,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:22,576 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 426 transitions. [2025-02-05 16:18:22,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 16:18:22,577 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:18:22,578 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:18:22,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:18:22,578 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:18:22,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:18:22,579 INFO L85 PathProgramCache]: Analyzing trace with hash 54885598, now seen corresponding path program 1 times [2025-02-05 16:18:22,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:18:22,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594091686] [2025-02-05 16:18:22,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:18:22,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:18:22,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 16:18:22,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 16:18:22,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:18:22,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:18:23,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:18:23,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:18:23,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594091686] [2025-02-05 16:18:23,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594091686] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:18:23,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:18:23,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 16:18:23,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436904561] [2025-02-05 16:18:23,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:18:23,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:18:23,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:18:23,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:18:23,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:18:23,319 INFO L87 Difference]: Start difference. First operand 290 states and 426 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:23,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:18:23,838 INFO L93 Difference]: Finished difference Result 515 states and 786 transitions. [2025-02-05 16:18:23,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 16:18:23,839 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-02-05 16:18:23,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:18:23,842 INFO L225 Difference]: With dead ends: 515 [2025-02-05 16:18:23,842 INFO L226 Difference]: Without dead ends: 292 [2025-02-05 16:18:23,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-02-05 16:18:23,843 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 218 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:18:23,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 824 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:18:23,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-02-05 16:18:23,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 290. [2025-02-05 16:18:23,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 1.467128027681661) internal successors, (424), 289 states have internal predecessors, (424), 0 states have call successors, (0), 0 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:18:23,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 424 transitions. [2025-02-05 16:18:23,863 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 424 transitions. Word has length 91 [2025-02-05 16:18:23,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:18:23,864 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 424 transitions. [2025-02-05 16:18:23,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:23,864 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 424 transitions. [2025-02-05 16:18:23,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:18:23,866 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:18:23,866 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:18:23,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:18:23,866 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:18:23,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:18:23,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1731991271, now seen corresponding path program 1 times [2025-02-05 16:18:23,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:18:23,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117906147] [2025-02-05 16:18:23,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:18:23,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:18:23,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:18:23,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:18:23,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:18:23,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:18:24,212 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:18:24,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:18:24,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117906147] [2025-02-05 16:18:24,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117906147] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:18:24,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:18:24,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:18:24,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970726604] [2025-02-05 16:18:24,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:18:24,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:18:24,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:18:24,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:18:24,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:18:24,220 INFO L87 Difference]: Start difference. First operand 290 states and 424 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:24,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:18:24,242 INFO L93 Difference]: Finished difference Result 298 states and 433 transitions. [2025-02-05 16:18:24,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:18:24,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-02-05 16:18:24,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:18:24,245 INFO L225 Difference]: With dead ends: 298 [2025-02-05 16:18:24,245 INFO L226 Difference]: Without dead ends: 296 [2025-02-05 16:18:24,245 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:18:24,247 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:18:24,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 635 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:18:24,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-02-05 16:18:24,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-02-05 16:18:24,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 1.4542372881355932) internal successors, (429), 295 states have internal predecessors, (429), 0 states have call successors, (0), 0 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:18:24,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 429 transitions. [2025-02-05 16:18:24,266 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 429 transitions. Word has length 92 [2025-02-05 16:18:24,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:18:24,266 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 429 transitions. [2025-02-05 16:18:24,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:24,267 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 429 transitions. [2025-02-05 16:18:24,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 16:18:24,269 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:18:24,271 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, 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:18:24,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:18:24,272 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:18:24,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:18:24,273 INFO L85 PathProgramCache]: Analyzing trace with hash -274829988, now seen corresponding path program 1 times [2025-02-05 16:18:24,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:18:24,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231469890] [2025-02-05 16:18:24,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:18:24,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:18:24,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:18:24,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:18:24,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:18:24,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:18:24,378 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:18:24,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:18:24,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231469890] [2025-02-05 16:18:24,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231469890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:18:24,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:18:24,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:18:24,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377455643] [2025-02-05 16:18:24,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:18:24,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:18:24,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:18:24,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:18:24,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:18:24,380 INFO L87 Difference]: Start difference. First operand 296 states and 429 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:24,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:18:24,407 INFO L93 Difference]: Finished difference Result 538 states and 810 transitions. [2025-02-05 16:18:24,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:18:24,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-02-05 16:18:24,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:18:24,411 INFO L225 Difference]: With dead ends: 538 [2025-02-05 16:18:24,411 INFO L226 Difference]: Without dead ends: 414 [2025-02-05 16:18:24,411 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:18:24,412 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 87 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:18:24,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 344 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:18:24,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-02-05 16:18:24,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 412. [2025-02-05 16:18:24,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.4841849148418491) internal successors, (610), 411 states have internal predecessors, (610), 0 states have call successors, (0), 0 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:18:24,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 610 transitions. [2025-02-05 16:18:24,437 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 610 transitions. Word has length 93 [2025-02-05 16:18:24,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:18:24,437 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 610 transitions. [2025-02-05 16:18:24,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:24,438 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 610 transitions. [2025-02-05 16:18:24,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 16:18:24,439 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:18:24,439 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, 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:18:24,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:18:24,439 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:18:24,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:18:24,440 INFO L85 PathProgramCache]: Analyzing trace with hash -283471332, now seen corresponding path program 1 times [2025-02-05 16:18:24,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:18:24,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008023778] [2025-02-05 16:18:24,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:18:24,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:18:24,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:18:24,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:18:24,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:18:24,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:18:24,552 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:18:24,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:18:24,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008023778] [2025-02-05 16:18:24,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008023778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:18:24,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:18:24,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:18:24,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601580827] [2025-02-05 16:18:24,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:18:24,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:18:24,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:18:24,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:18:24,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:18:24,555 INFO L87 Difference]: Start difference. First operand 412 states and 610 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:24,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:18:24,588 INFO L93 Difference]: Finished difference Result 1074 states and 1650 transitions. [2025-02-05 16:18:24,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:18:24,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-02-05 16:18:24,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:18:24,593 INFO L225 Difference]: With dead ends: 1074 [2025-02-05 16:18:24,593 INFO L226 Difference]: Without dead ends: 731 [2025-02-05 16:18:24,594 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:18:24,595 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 85 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:18:24,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 350 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:18:24,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2025-02-05 16:18:24,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 729. [2025-02-05 16:18:24,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 728 states have (on average 1.5137362637362637) internal successors, (1102), 728 states have internal predecessors, (1102), 0 states have call successors, (0), 0 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:18:24,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1102 transitions. [2025-02-05 16:18:24,630 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1102 transitions. Word has length 93 [2025-02-05 16:18:24,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:18:24,631 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 1102 transitions. [2025-02-05 16:18:24,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1102 transitions. [2025-02-05 16:18:24,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 16:18:24,632 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:18:24,632 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, 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:18:24,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:18:24,632 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:18:24,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:18:24,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1691936476, now seen corresponding path program 1 times [2025-02-05 16:18:24,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:18:24,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304480740] [2025-02-05 16:18:24,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:18:24,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:18:24,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:18:24,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:18:24,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:18:24,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:18:24,731 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:18:24,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:18:24,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304480740] [2025-02-05 16:18:24,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304480740] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:18:24,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:18:24,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:18:24,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611744288] [2025-02-05 16:18:24,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:18:24,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:18:24,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:18:24,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:18:24,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:18:24,733 INFO L87 Difference]: Start difference. First operand 729 states and 1102 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:24,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:18:24,768 INFO L93 Difference]: Finished difference Result 2001 states and 3084 transitions. [2025-02-05 16:18:24,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:18:24,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-02-05 16:18:24,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:18:24,776 INFO L225 Difference]: With dead ends: 2001 [2025-02-05 16:18:24,776 INFO L226 Difference]: Without dead ends: 1341 [2025-02-05 16:18:24,777 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:18:24,778 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 83 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:18:24,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 352 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:18:24,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2025-02-05 16:18:24,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1339. [2025-02-05 16:18:24,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1339 states, 1338 states have (on average 1.5231689088191331) internal successors, (2038), 1338 states have internal predecessors, (2038), 0 states have call successors, (0), 0 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:18:24,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2038 transitions. [2025-02-05 16:18:24,847 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2038 transitions. Word has length 93 [2025-02-05 16:18:24,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:18:24,847 INFO L471 AbstractCegarLoop]: Abstraction has 1339 states and 2038 transitions. [2025-02-05 16:18:24,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:24,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2038 transitions. [2025-02-05 16:18:24,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 16:18:24,849 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:18:24,850 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, 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:18:24,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:18:24,850 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:18:24,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:18:24,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1537567644, now seen corresponding path program 1 times [2025-02-05 16:18:24,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:18:24,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393475833] [2025-02-05 16:18:24,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:18:24,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:18:24,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:18:24,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:18:24,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:18:24,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:18:24,955 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:18:24,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:18:24,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393475833] [2025-02-05 16:18:24,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393475833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:18:24,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:18:24,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:18:24,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187652274] [2025-02-05 16:18:24,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:18:24,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:18:24,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:18:24,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:18:24,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:18:24,957 INFO L87 Difference]: Start difference. First operand 1339 states and 2038 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:25,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:18:25,024 INFO L93 Difference]: Finished difference Result 3783 states and 5808 transitions. [2025-02-05 16:18:25,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:18:25,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-02-05 16:18:25,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:18:25,036 INFO L225 Difference]: With dead ends: 3783 [2025-02-05 16:18:25,036 INFO L226 Difference]: Without dead ends: 2513 [2025-02-05 16:18:25,042 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:18:25,043 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 81 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:18:25,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 354 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:18:25,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2025-02-05 16:18:25,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2511. [2025-02-05 16:18:25,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2511 states, 2510 states have (on average 1.5195219123505976) internal successors, (3814), 2510 states have internal predecessors, (3814), 0 states have call successors, (0), 0 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:18:25,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 3814 transitions. [2025-02-05 16:18:25,128 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 3814 transitions. Word has length 93 [2025-02-05 16:18:25,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:18:25,129 INFO L471 AbstractCegarLoop]: Abstraction has 2511 states and 3814 transitions. [2025-02-05 16:18:25,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:25,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 3814 transitions. [2025-02-05 16:18:25,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 16:18:25,131 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:18:25,131 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, 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:18:25,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:18:25,131 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:18:25,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:18:25,132 INFO L85 PathProgramCache]: Analyzing trace with hash 558637148, now seen corresponding path program 1 times [2025-02-05 16:18:25,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:18:25,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919032855] [2025-02-05 16:18:25,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:18:25,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:18:25,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:18:25,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:18:25,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:18:25,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:18:25,216 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:18:25,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:18:25,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919032855] [2025-02-05 16:18:25,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919032855] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:18:25,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:18:25,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:18:25,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114642267] [2025-02-05 16:18:25,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:18:25,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:18:25,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:18:25,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:18:25,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:18:25,219 INFO L87 Difference]: Start difference. First operand 2511 states and 3814 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:25,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:18:25,319 INFO L93 Difference]: Finished difference Result 7203 states and 10968 transitions. [2025-02-05 16:18:25,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:18:25,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-02-05 16:18:25,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:18:25,342 INFO L225 Difference]: With dead ends: 7203 [2025-02-05 16:18:25,342 INFO L226 Difference]: Without dead ends: 4761 [2025-02-05 16:18:25,350 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:18:25,352 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 79 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:18:25,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 356 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:18:25,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4761 states. [2025-02-05 16:18:25,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4761 to 4759. [2025-02-05 16:18:25,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4759 states, 4758 states have (on average 1.5077763766288357) internal successors, (7174), 4758 states have internal predecessors, (7174), 0 states have call successors, (0), 0 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:18:25,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4759 states to 4759 states and 7174 transitions. [2025-02-05 16:18:25,513 INFO L78 Accepts]: Start accepts. Automaton has 4759 states and 7174 transitions. Word has length 93 [2025-02-05 16:18:25,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:18:25,514 INFO L471 AbstractCegarLoop]: Abstraction has 4759 states and 7174 transitions. [2025-02-05 16:18:25,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:25,514 INFO L276 IsEmpty]: Start isEmpty. Operand 4759 states and 7174 transitions. [2025-02-05 16:18:25,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 16:18:25,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:18:25,515 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, 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:18:25,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:18:25,516 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:18:25,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:18:25,516 INFO L85 PathProgramCache]: Analyzing trace with hash 110691612, now seen corresponding path program 1 times [2025-02-05 16:18:25,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:18:25,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015862679] [2025-02-05 16:18:25,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:18:25,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:18:25,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:18:25,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:18:25,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:18:25,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:18:25,597 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:18:25,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:18:25,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015862679] [2025-02-05 16:18:25,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015862679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:18:25,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:18:25,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:18:25,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445402317] [2025-02-05 16:18:25,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:18:25,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:18:25,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:18:25,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:18:25,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:18:25,599 INFO L87 Difference]: Start difference. First operand 4759 states and 7174 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:25,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:18:25,795 INFO L93 Difference]: Finished difference Result 13755 states and 20712 transitions. [2025-02-05 16:18:25,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:18:25,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-02-05 16:18:25,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:18:25,837 INFO L225 Difference]: With dead ends: 13755 [2025-02-05 16:18:25,838 INFO L226 Difference]: Without dead ends: 9065 [2025-02-05 16:18:25,846 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:18:25,847 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 77 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:18:25,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 358 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:18:25,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9065 states. [2025-02-05 16:18:26,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9065 to 9063. [2025-02-05 16:18:26,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9063 states, 9062 states have (on average 1.490840873979254) internal successors, (13510), 9062 states have internal predecessors, (13510), 0 states have call successors, (0), 0 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:18:26,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9063 states to 9063 states and 13510 transitions. [2025-02-05 16:18:26,182 INFO L78 Accepts]: Start accepts. Automaton has 9063 states and 13510 transitions. Word has length 93 [2025-02-05 16:18:26,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:18:26,182 INFO L471 AbstractCegarLoop]: Abstraction has 9063 states and 13510 transitions. [2025-02-05 16:18:26,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:26,183 INFO L276 IsEmpty]: Start isEmpty. Operand 9063 states and 13510 transitions. [2025-02-05 16:18:26,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 16:18:26,184 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:18:26,184 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, 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:18:26,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:18:26,184 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:18:26,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:18:26,185 INFO L85 PathProgramCache]: Analyzing trace with hash 525867484, now seen corresponding path program 1 times [2025-02-05 16:18:26,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:18:26,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59985145] [2025-02-05 16:18:26,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:18:26,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:18:26,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:18:26,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:18:26,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:18:26,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:18:26,272 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:18:26,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:18:26,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59985145] [2025-02-05 16:18:26,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59985145] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:18:26,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:18:26,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:18:26,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368966079] [2025-02-05 16:18:26,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:18:26,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:18:26,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:18:26,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:18:26,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:18:26,275 INFO L87 Difference]: Start difference. First operand 9063 states and 13510 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:26,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:18:26,637 INFO L93 Difference]: Finished difference Result 26283 states and 39048 transitions. [2025-02-05 16:18:26,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:18:26,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-02-05 16:18:26,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:18:26,700 INFO L225 Difference]: With dead ends: 26283 [2025-02-05 16:18:26,700 INFO L226 Difference]: Without dead ends: 17289 [2025-02-05 16:18:26,714 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:18:26,715 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 75 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:18:26,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 360 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:18:26,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17289 states. [2025-02-05 16:18:27,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17289 to 17287. [2025-02-05 16:18:27,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17287 states, 17286 states have (on average 1.4702071040148097) internal successors, (25414), 17286 states have internal predecessors, (25414), 0 states have call successors, (0), 0 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:18:27,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17287 states to 17287 states and 25414 transitions. [2025-02-05 16:18:27,302 INFO L78 Accepts]: Start accepts. Automaton has 17287 states and 25414 transitions. Word has length 93 [2025-02-05 16:18:27,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:18:27,303 INFO L471 AbstractCegarLoop]: Abstraction has 17287 states and 25414 transitions. [2025-02-05 16:18:27,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:27,307 INFO L276 IsEmpty]: Start isEmpty. Operand 17287 states and 25414 transitions. [2025-02-05 16:18:27,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 16:18:27,308 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:18:27,308 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, 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:18:27,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:18:27,308 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:18:27,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:18:27,309 INFO L85 PathProgramCache]: Analyzing trace with hash 39149212, now seen corresponding path program 1 times [2025-02-05 16:18:27,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:18:27,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915623495] [2025-02-05 16:18:27,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:18:27,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:18:27,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:18:27,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:18:27,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:18:27,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:18:27,393 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:18:27,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:18:27,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915623495] [2025-02-05 16:18:27,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915623495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:18:27,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:18:27,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:18:27,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216751630] [2025-02-05 16:18:27,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:18:27,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:18:27,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:18:27,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:18:27,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:18:27,396 INFO L87 Difference]: Start difference. First operand 17287 states and 25414 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:28,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:18:28,028 INFO L93 Difference]: Finished difference Result 50187 states and 73416 transitions. [2025-02-05 16:18:28,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:18:28,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-02-05 16:18:28,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:18:28,114 INFO L225 Difference]: With dead ends: 50187 [2025-02-05 16:18:28,114 INFO L226 Difference]: Without dead ends: 32969 [2025-02-05 16:18:28,140 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:18:28,141 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 73 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:18:28,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 362 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:18:28,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32969 states. [2025-02-05 16:18:29,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32969 to 32967. [2025-02-05 16:18:29,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32967 states, 32966 states have (on average 1.446520657647273) internal successors, (47686), 32966 states have internal predecessors, (47686), 0 states have call successors, (0), 0 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:18:29,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32967 states to 32967 states and 47686 transitions. [2025-02-05 16:18:29,388 INFO L78 Accepts]: Start accepts. Automaton has 32967 states and 47686 transitions. Word has length 93 [2025-02-05 16:18:29,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:18:29,390 INFO L471 AbstractCegarLoop]: Abstraction has 32967 states and 47686 transitions. [2025-02-05 16:18:29,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:29,390 INFO L276 IsEmpty]: Start isEmpty. Operand 32967 states and 47686 transitions. [2025-02-05 16:18:29,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 16:18:29,403 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:18:29,404 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:29,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:18:29,404 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:18:29,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:18:29,405 INFO L85 PathProgramCache]: Analyzing trace with hash -418722285, now seen corresponding path program 1 times [2025-02-05 16:18:29,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:18:29,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330856887] [2025-02-05 16:18:29,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:18:29,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:18:29,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 16:18:29,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 16:18:29,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:18:29,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:18:29,820 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:18:29,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:18:29,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330856887] [2025-02-05 16:18:29,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330856887] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:18:29,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:18:29,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 16:18:29,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887108769] [2025-02-05 16:18:29,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:18:29,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:18:29,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:18:29,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:18:29,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:18:29,822 INFO L87 Difference]: Start difference. First operand 32967 states and 47686 transitions. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 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:18:33,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:18:33,378 INFO L93 Difference]: Finished difference Result 292953 states and 423759 transitions. [2025-02-05 16:18:33,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 16:18:33,379 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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 118 [2025-02-05 16:18:33,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:18:34,205 INFO L225 Difference]: With dead ends: 292953 [2025-02-05 16:18:34,205 INFO L226 Difference]: Without dead ends: 269911 [2025-02-05 16:18:34,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-05 16:18:34,360 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 1556 mSDsluCounter, 2448 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1556 SdHoareTripleChecker+Valid, 2712 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:18:34,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1556 Valid, 2712 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:18:34,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269911 states. [2025-02-05 16:18:38,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269911 to 60999. [2025-02-05 16:18:38,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60999 states, 60998 states have (on average 1.4406701859077347) internal successors, (87878), 60998 states have internal predecessors, (87878), 0 states have call successors, (0), 0 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:18:38,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60999 states to 60999 states and 87878 transitions. [2025-02-05 16:18:38,726 INFO L78 Accepts]: Start accepts. Automaton has 60999 states and 87878 transitions. Word has length 118 [2025-02-05 16:18:38,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:18:38,726 INFO L471 AbstractCegarLoop]: Abstraction has 60999 states and 87878 transitions. [2025-02-05 16:18:38,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 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:18:38,727 INFO L276 IsEmpty]: Start isEmpty. Operand 60999 states and 87878 transitions. [2025-02-05 16:18:38,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 16:18:38,740 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:18:38,740 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:38,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:18:38,740 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:18:38,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:18:38,741 INFO L85 PathProgramCache]: Analyzing trace with hash -427363629, now seen corresponding path program 1 times [2025-02-05 16:18:38,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:18:38,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403488900] [2025-02-05 16:18:38,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:18:38,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:18:38,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 16:18:38,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 16:18:38,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:18:38,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:18:39,600 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:18:39,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:18:39,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403488900] [2025-02-05 16:18:39,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403488900] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:18:39,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:18:39,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 16:18:39,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701598522] [2025-02-05 16:18:39,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:18:39,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:18:39,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:18:39,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:18:39,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:18:39,605 INFO L87 Difference]: Start difference. First operand 60999 states and 87878 transitions. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:18:46,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:18:46,739 INFO L93 Difference]: Finished difference Result 325849 states and 471119 transitions. [2025-02-05 16:18:46,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 16:18:46,740 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 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 118 [2025-02-05 16:18:46,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:18:47,482 INFO L225 Difference]: With dead ends: 325849 [2025-02-05 16:18:47,482 INFO L226 Difference]: Without dead ends: 292951 [2025-02-05 16:18:47,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-05 16:18:47,601 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 1556 mSDsluCounter, 2431 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1556 SdHoareTripleChecker+Valid, 2694 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:18:47,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1556 Valid, 2694 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:18:47,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292951 states. [2025-02-05 16:18:51,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292951 to 105415. [2025-02-05 16:18:52,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105415 states, 105414 states have (on average 1.4371335875690137) internal successors, (151494), 105414 states have internal predecessors, (151494), 0 states have call successors, (0), 0 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:18:52,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105415 states to 105415 states and 151494 transitions. [2025-02-05 16:18:52,568 INFO L78 Accepts]: Start accepts. Automaton has 105415 states and 151494 transitions. Word has length 118 [2025-02-05 16:18:52,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:18:52,569 INFO L471 AbstractCegarLoop]: Abstraction has 105415 states and 151494 transitions. [2025-02-05 16:18:52,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:18:52,569 INFO L276 IsEmpty]: Start isEmpty. Operand 105415 states and 151494 transitions. [2025-02-05 16:18:52,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 16:18:52,583 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:18:52,583 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:52,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:18:52,583 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:18:52,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:18:52,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1548044179, now seen corresponding path program 1 times [2025-02-05 16:18:52,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:18:52,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693165034] [2025-02-05 16:18:52,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:18:52,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:18:52,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 16:18:52,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 16:18:52,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:18:52,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:18:53,019 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 16:18:53,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:18:53,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693165034] [2025-02-05 16:18:53,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693165034] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:18:53,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:18:53,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 16:18:53,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108467864] [2025-02-05 16:18:53,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:18:53,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:18:53,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:18:53,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:18:53,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:18:53,020 INFO L87 Difference]: Start difference. First operand 105415 states and 151494 transitions. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:59,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:18:59,516 INFO L93 Difference]: Finished difference Result 358745 states and 518351 transitions. [2025-02-05 16:18:59,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 16:18:59,516 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2025-02-05 16:18:59,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:19:00,129 INFO L225 Difference]: With dead ends: 358745 [2025-02-05 16:19:00,129 INFO L226 Difference]: Without dead ends: 325847 [2025-02-05 16:19:00,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-05 16:19:00,429 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 1578 mSDsluCounter, 2348 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1578 SdHoareTripleChecker+Valid, 2609 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:19:00,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1578 Valid, 2609 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:19:00,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325847 states. [2025-02-05 16:19:05,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325847 to 138311. [2025-02-05 16:19:06,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138311 states, 138310 states have (on average 1.4368158484563662) internal successors, (198726), 138310 states have internal predecessors, (198726), 0 states have call successors, (0), 0 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:19:06,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138311 states to 138311 states and 198726 transitions. [2025-02-05 16:19:06,488 INFO L78 Accepts]: Start accepts. Automaton has 138311 states and 198726 transitions. Word has length 118 [2025-02-05 16:19:06,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:19:06,488 INFO L471 AbstractCegarLoop]: Abstraction has 138311 states and 198726 transitions. [2025-02-05 16:19:06,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:19:06,489 INFO L276 IsEmpty]: Start isEmpty. Operand 138311 states and 198726 transitions. [2025-02-05 16:19:06,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 16:19:06,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:19:06,502 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:06,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:19:06,502 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:19:06,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:19:06,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1393675347, now seen corresponding path program 1 times [2025-02-05 16:19:06,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:19:06,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635517945] [2025-02-05 16:19:06,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:19:06,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:19:06,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 16:19:06,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 16:19:06,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:19:06,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:19:07,026 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 16:19:07,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:19:07,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635517945] [2025-02-05 16:19:07,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635517945] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:19:07,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:19:07,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 16:19:07,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268708880] [2025-02-05 16:19:07,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:19:07,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:19:07,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:19:07,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:19:07,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:19:07,028 INFO L87 Difference]: Start difference. First operand 138311 states and 198726 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)