./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-81.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ec23d859d65533fc787a9c2fed70b8c69daa3b1ed2a3fca10d530d490a26e0e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:55:09,608 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:55:09,666 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 18:55:09,671 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:55:09,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:55:09,692 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:55:09,693 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:55:09,694 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:55:09,694 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:55:09,694 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:55:09,694 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:55:09,694 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:55:09,694 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:55:09,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:55:09,694 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:55:09,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:55:09,695 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:55:09,695 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 18:55:09,695 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:55:09,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 18:55:09,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:55:09,695 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:55:09,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:55:09,695 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:55:09,695 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 18:55:09,695 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:55:09,695 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:55:09,695 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:55:09,695 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:55:09,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:55:09,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:55:09,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:55:09,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:55:09,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:55:09,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:55:09,695 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:55:09,696 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:55:09,696 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:55:09,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:55:09,696 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:55:09,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:55:09,696 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:55:09,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:55:09,696 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ec23d859d65533fc787a9c2fed70b8c69daa3b1ed2a3fca10d530d490a26e0e [2025-03-03 18:55:09,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:55:09,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:55:09,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:55:09,921 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:55:09,921 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:55:09,923 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-81.i [2025-03-03 18:55:11,014 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20a1cc385/cad62448f7854f519d992a03088f803d/FLAGbe9ff339e [2025-03-03 18:55:11,264 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:55:11,264 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-81.i [2025-03-03 18:55:11,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20a1cc385/cad62448f7854f519d992a03088f803d/FLAGbe9ff339e [2025-03-03 18:55:11,599 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20a1cc385/cad62448f7854f519d992a03088f803d [2025-03-03 18:55:11,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:55:11,601 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:55:11,602 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:55:11,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:55:11,605 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:55:11,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:55:11" (1/1) ... [2025-03-03 18:55:11,606 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@baf7e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:55:11, skipping insertion in model container [2025-03-03 18:55:11,606 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:55:11" (1/1) ... [2025-03-03 18:55:11,621 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:55:11,721 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-81.i[913,926] [2025-03-03 18:55:11,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:55:11,793 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:55:11,804 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-81.i[913,926] [2025-03-03 18:55:11,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:55:11,852 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:55:11,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:55:11 WrapperNode [2025-03-03 18:55:11,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:55:11,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:55:11,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:55:11,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:55:11,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:55:11" (1/1) ... [2025-03-03 18:55:11,869 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:55:11" (1/1) ... [2025-03-03 18:55:11,909 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2025-03-03 18:55:11,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:55:11,909 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:55:11,910 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:55:11,910 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:55:11,916 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:55:11" (1/1) ... [2025-03-03 18:55:11,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:55:11" (1/1) ... [2025-03-03 18:55:11,923 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:55:11" (1/1) ... [2025-03-03 18:55:11,938 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 18:55:11,939 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:55:11" (1/1) ... [2025-03-03 18:55:11,939 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:55:11" (1/1) ... [2025-03-03 18:55:11,944 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:55:11" (1/1) ... [2025-03-03 18:55:11,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:55:11" (1/1) ... [2025-03-03 18:55:11,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:55:11" (1/1) ... [2025-03-03 18:55:11,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:55:11" (1/1) ... [2025-03-03 18:55:11,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:55:11,949 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:55:11,949 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:55:11,949 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:55:11,950 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:55:11" (1/1) ... [2025-03-03 18:55:11,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:55:11,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:55:11,979 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 18:55:11,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 18:55:12,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:55:12,001 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 18:55:12,001 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 18:55:12,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:55:12,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:55:12,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:55:12,050 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:55:12,051 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:55:12,329 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L135: havoc property_#t~bitwise21#1;havoc property_#t~short22#1; [2025-03-03 18:55:12,359 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 18:55:12,359 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:55:12,371 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:55:12,373 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:55:12,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:55:12 BoogieIcfgContainer [2025-03-03 18:55:12,374 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:55:12,375 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:55:12,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:55:12,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:55:12,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:55:11" (1/3) ... [2025-03-03 18:55:12,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cdd4e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:55:12, skipping insertion in model container [2025-03-03 18:55:12,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:55:11" (2/3) ... [2025-03-03 18:55:12,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cdd4e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:55:12, skipping insertion in model container [2025-03-03 18:55:12,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:55:12" (3/3) ... [2025-03-03 18:55:12,381 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-81.i [2025-03-03 18:55:12,392 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:55:12,393 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-81.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:55:12,428 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:55:12,437 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;@26a550ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:55:12,437 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:55:12,439 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 50 states have (on average 1.34) internal successors, (67), 51 states have internal predecessors, (67), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 18:55:12,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-03 18:55:12,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:55:12,453 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:55:12,453 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:55:12,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:55:12,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1464993066, now seen corresponding path program 1 times [2025-03-03 18:55:12,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:55:12,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349479626] [2025-03-03 18:55:12,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:55:12,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:55:12,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 18:55:12,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 18:55:12,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:55:12,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:55:12,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-03-03 18:55:12,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:55:12,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349479626] [2025-03-03 18:55:12,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349479626] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:55:12,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350352709] [2025-03-03 18:55:12,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:55:12,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:55:12,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:55:12,741 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:55:12,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 18:55:12,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 18:55:12,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 18:55:12,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:55:12,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:55:12,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 18:55:12,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:55:12,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-03-03 18:55:12,933 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:55:12,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350352709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:55:12,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:55:12,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 18:55:12,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230010768] [2025-03-03 18:55:12,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:55:12,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 18:55:12,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:55:12,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 18:55:12,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:55:12,958 INFO L87 Difference]: Start difference. First operand has 85 states, 50 states have (on average 1.34) internal successors, (67), 51 states have internal predecessors, (67), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 18:55:12,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:55:12,979 INFO L93 Difference]: Finished difference Result 164 states and 289 transitions. [2025-03-03 18:55:12,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 18:55:12,981 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 196 [2025-03-03 18:55:12,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:55:12,985 INFO L225 Difference]: With dead ends: 164 [2025-03-03 18:55:12,985 INFO L226 Difference]: Without dead ends: 82 [2025-03-03 18:55:12,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:55:12,989 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:55:12,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:55:12,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-03 18:55:13,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-03 18:55:13,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 48 states have internal predecessors, (62), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 18:55:13,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 126 transitions. [2025-03-03 18:55:13,022 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 126 transitions. Word has length 196 [2025-03-03 18:55:13,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:55:13,022 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 126 transitions. [2025-03-03 18:55:13,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 18:55:13,022 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 126 transitions. [2025-03-03 18:55:13,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-03 18:55:13,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:55:13,025 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:55:13,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 18:55:13,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 18:55:13,226 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:55:13,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:55:13,226 INFO L85 PathProgramCache]: Analyzing trace with hash 760011478, now seen corresponding path program 1 times [2025-03-03 18:55:13,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:55:13,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233156004] [2025-03-03 18:55:13,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:55:13,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:55:13,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 18:55:13,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 18:55:13,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:55:13,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:55:22,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 18:55:22,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:55:22,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233156004] [2025-03-03 18:55:22,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233156004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:55:22,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:55:22,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 18:55:22,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623470161] [2025-03-03 18:55:22,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:55:22,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 18:55:22,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:55:22,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 18:55:22,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:55:22,995 INFO L87 Difference]: Start difference. First operand 82 states and 126 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 18:55:23,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:55:23,593 INFO L93 Difference]: Finished difference Result 291 states and 430 transitions. [2025-03-03 18:55:23,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 18:55:23,595 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 196 [2025-03-03 18:55:23,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:55:23,597 INFO L225 Difference]: With dead ends: 291 [2025-03-03 18:55:23,597 INFO L226 Difference]: Without dead ends: 212 [2025-03-03 18:55:23,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:55:23,601 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 264 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:55:23,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 431 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:55:23,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-03 18:55:23,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 128. [2025-03-03 18:55:23,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 88 states have internal predecessors, (120), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 18:55:23,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 196 transitions. [2025-03-03 18:55:23,628 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 196 transitions. Word has length 196 [2025-03-03 18:55:23,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:55:23,629 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 196 transitions. [2025-03-03 18:55:23,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 18:55:23,629 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 196 transitions. [2025-03-03 18:55:23,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-03 18:55:23,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:55:23,634 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:55:23,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 18:55:23,634 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:55:23,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:55:23,634 INFO L85 PathProgramCache]: Analyzing trace with hash 466608471, now seen corresponding path program 1 times [2025-03-03 18:55:23,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:55:23,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476003959] [2025-03-03 18:55:23,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:55:23,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:55:23,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 18:55:23,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 18:55:23,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:55:23,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:55:29,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 18:55:29,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:55:29,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476003959] [2025-03-03 18:55:29,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476003959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:55:29,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:55:29,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 18:55:29,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624907899] [2025-03-03 18:55:29,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:55:29,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 18:55:29,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:55:29,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 18:55:29,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:55:29,718 INFO L87 Difference]: Start difference. First operand 128 states and 196 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 18:55:30,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:55:30,523 INFO L93 Difference]: Finished difference Result 309 states and 462 transitions. [2025-03-03 18:55:30,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 18:55:30,524 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 196 [2025-03-03 18:55:30,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:55:30,525 INFO L225 Difference]: With dead ends: 309 [2025-03-03 18:55:30,525 INFO L226 Difference]: Without dead ends: 184 [2025-03-03 18:55:30,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2025-03-03 18:55:30,526 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 287 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:55:30,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 452 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:55:30,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-03 18:55:30,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 127. [2025-03-03 18:55:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 86 states have (on average 1.372093023255814) internal successors, (118), 87 states have internal predecessors, (118), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 18:55:30,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 194 transitions. [2025-03-03 18:55:30,542 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 194 transitions. Word has length 196 [2025-03-03 18:55:30,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:55:30,542 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 194 transitions. [2025-03-03 18:55:30,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 18:55:30,542 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 194 transitions. [2025-03-03 18:55:30,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-03 18:55:30,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:55:30,544 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:55:30,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 18:55:30,544 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:55:30,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:55:30,544 INFO L85 PathProgramCache]: Analyzing trace with hash -2027404009, now seen corresponding path program 1 times [2025-03-03 18:55:30,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:55:30,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351381023] [2025-03-03 18:55:30,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:55:30,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:55:30,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 18:55:30,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 18:55:30,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:55:30,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:55:30,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 18:55:30,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:55:30,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351381023] [2025-03-03 18:55:30,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351381023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:55:30,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:55:30,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:55:30,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664024969] [2025-03-03 18:55:30,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:55:30,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:55:30,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:55:30,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:55:30,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:55:30,695 INFO L87 Difference]: Start difference. First operand 127 states and 194 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 18:55:30,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:55:30,828 INFO L93 Difference]: Finished difference Result 345 states and 529 transitions. [2025-03-03 18:55:30,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:55:30,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 196 [2025-03-03 18:55:30,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:55:30,832 INFO L225 Difference]: With dead ends: 345 [2025-03-03 18:55:30,832 INFO L226 Difference]: Without dead ends: 221 [2025-03-03 18:55:30,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:55:30,835 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 66 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:55:30,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 309 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:55:30,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-03 18:55:30,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2025-03-03 18:55:30,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 138 states have (on average 1.3333333333333333) internal successors, (184), 140 states have internal predecessors, (184), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-03 18:55:30,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 336 transitions. [2025-03-03 18:55:30,881 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 336 transitions. Word has length 196 [2025-03-03 18:55:30,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:55:30,882 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 336 transitions. [2025-03-03 18:55:30,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 18:55:30,882 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 336 transitions. [2025-03-03 18:55:30,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 18:55:30,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:55:30,884 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:55:30,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 18:55:30,884 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:55:30,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:55:30,884 INFO L85 PathProgramCache]: Analyzing trace with hash -972007018, now seen corresponding path program 1 times [2025-03-03 18:55:30,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:55:30,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176410873] [2025-03-03 18:55:30,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:55:30,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:55:30,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 18:55:30,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 18:55:30,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:55:30,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:55:39,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 18:55:39,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:55:39,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176410873] [2025-03-03 18:55:39,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176410873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:55:39,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:55:39,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 18:55:39,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187002052] [2025-03-03 18:55:39,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:55:39,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 18:55:39,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:55:39,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 18:55:39,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:55:39,740 INFO L87 Difference]: Start difference. First operand 219 states and 336 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 18:55:41,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:55:41,021 INFO L93 Difference]: Finished difference Result 431 states and 642 transitions. [2025-03-03 18:55:41,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 18:55:41,022 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 197 [2025-03-03 18:55:41,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:55:41,024 INFO L225 Difference]: With dead ends: 431 [2025-03-03 18:55:41,024 INFO L226 Difference]: Without dead ends: 307 [2025-03-03 18:55:41,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2025-03-03 18:55:41,025 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 154 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 18:55:41,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 709 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 18:55:41,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-03 18:55:41,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 228. [2025-03-03 18:55:41,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 147 states have (on average 1.3401360544217686) internal successors, (197), 149 states have internal predecessors, (197), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-03 18:55:41,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 349 transitions. [2025-03-03 18:55:41,056 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 349 transitions. Word has length 197 [2025-03-03 18:55:41,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:55:41,056 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 349 transitions. [2025-03-03 18:55:41,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 18:55:41,056 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 349 transitions. [2025-03-03 18:55:41,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 18:55:41,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:55:41,061 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:55:41,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 18:55:41,061 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:55:41,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:55:41,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1478844489, now seen corresponding path program 1 times [2025-03-03 18:55:41,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:55:41,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508017135] [2025-03-03 18:55:41,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:55:41,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:55:41,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 18:55:41,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 18:55:41,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:55:41,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:55:45,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 18:55:45,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:55:45,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508017135] [2025-03-03 18:55:45,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508017135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:55:45,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:55:45,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 18:55:45,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130030567] [2025-03-03 18:55:45,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:55:45,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 18:55:45,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:55:45,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 18:55:45,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:55:45,517 INFO L87 Difference]: Start difference. First operand 228 states and 349 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 18:55:46,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:55:46,161 INFO L93 Difference]: Finished difference Result 402 states and 603 transitions. [2025-03-03 18:55:46,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:55:46,162 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 197 [2025-03-03 18:55:46,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:55:46,168 INFO L225 Difference]: With dead ends: 402 [2025-03-03 18:55:46,168 INFO L226 Difference]: Without dead ends: 269 [2025-03-03 18:55:46,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-03-03 18:55:46,169 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 107 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:55:46,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 601 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:55:46,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-03 18:55:46,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 231. [2025-03-03 18:55:46,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 150 states have (on average 1.34) internal successors, (201), 152 states have internal predecessors, (201), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-03 18:55:46,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 353 transitions. [2025-03-03 18:55:46,192 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 353 transitions. Word has length 197 [2025-03-03 18:55:46,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:55:46,192 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 353 transitions. [2025-03-03 18:55:46,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 18:55:46,192 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 353 transitions. [2025-03-03 18:55:46,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 18:55:46,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:55:46,194 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:55:46,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 18:55:46,194 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:55:46,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:55:46,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1477565643, now seen corresponding path program 1 times [2025-03-03 18:55:46,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:55:46,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136612567] [2025-03-03 18:55:46,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:55:46,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:55:46,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 18:55:46,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 18:55:46,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:55:46,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:55:49,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 18:55:49,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:55:49,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136612567] [2025-03-03 18:55:49,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136612567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:55:49,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:55:49,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 18:55:49,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349998827] [2025-03-03 18:55:49,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:55:49,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 18:55:49,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:55:49,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 18:55:49,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:55:49,977 INFO L87 Difference]: Start difference. First operand 231 states and 353 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 18:55:50,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:55:50,536 INFO L93 Difference]: Finished difference Result 423 states and 628 transitions. [2025-03-03 18:55:50,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:55:50,537 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 197 [2025-03-03 18:55:50,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:55:50,540 INFO L225 Difference]: With dead ends: 423 [2025-03-03 18:55:50,540 INFO L226 Difference]: Without dead ends: 287 [2025-03-03 18:55:50,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:55:50,541 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 201 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:55:50,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 552 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:55:50,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-03 18:55:50,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 231. [2025-03-03 18:55:50,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 150 states have (on average 1.34) internal successors, (201), 152 states have internal predecessors, (201), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-03 18:55:50,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 353 transitions. [2025-03-03 18:55:50,564 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 353 transitions. Word has length 197 [2025-03-03 18:55:50,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:55:50,565 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 353 transitions. [2025-03-03 18:55:50,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 18:55:50,565 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 353 transitions. [2025-03-03 18:55:50,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 18:55:50,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:55:50,566 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:55:50,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 18:55:50,566 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:55:50,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:55:50,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1020450294, now seen corresponding path program 1 times [2025-03-03 18:55:50,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:55:50,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218905659] [2025-03-03 18:55:50,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:55:50,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:55:50,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 18:55:50,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 18:55:50,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:55:50,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:55:54,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 18:55:54,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:55:54,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218905659] [2025-03-03 18:55:54,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218905659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:55:54,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:55:54,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 18:55:54,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477571415] [2025-03-03 18:55:54,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:55:54,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 18:55:54,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:55:54,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 18:55:54,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:55:54,547 INFO L87 Difference]: Start difference. First operand 231 states and 353 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 18:55:55,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:55:55,061 INFO L93 Difference]: Finished difference Result 419 states and 622 transitions. [2025-03-03 18:55:55,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:55:55,062 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 197 [2025-03-03 18:55:55,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:55:55,065 INFO L225 Difference]: With dead ends: 419 [2025-03-03 18:55:55,065 INFO L226 Difference]: Without dead ends: 283 [2025-03-03 18:55:55,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:55:55,065 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 157 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:55:55,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 623 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:55:55,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-03 18:55:55,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 222. [2025-03-03 18:55:55,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 141 states have (on average 1.326241134751773) internal successors, (187), 143 states have internal predecessors, (187), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-03 18:55:55,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 339 transitions. [2025-03-03 18:55:55,089 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 339 transitions. Word has length 197 [2025-03-03 18:55:55,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:55:55,089 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 339 transitions. [2025-03-03 18:55:55,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 18:55:55,089 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 339 transitions. [2025-03-03 18:55:55,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 18:55:55,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:55:55,090 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:55:55,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 18:55:55,090 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:55:55,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:55:55,090 INFO L85 PathProgramCache]: Analyzing trace with hash -912271146, now seen corresponding path program 1 times [2025-03-03 18:55:55,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:55:55,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407375282] [2025-03-03 18:55:55,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:55:55,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:55:55,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 18:55:55,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 18:55:55,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:55:55,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:55:55,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 18:55:55,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:55:55,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407375282] [2025-03-03 18:55:55,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407375282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:55:55,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:55:55,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 18:55:55,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945035266] [2025-03-03 18:55:55,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:55:55,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 18:55:55,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:55:55,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 18:55:55,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 18:55:55,124 INFO L87 Difference]: Start difference. First operand 222 states and 339 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 18:55:55,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:55:55,170 INFO L93 Difference]: Finished difference Result 534 states and 810 transitions. [2025-03-03 18:55:55,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 18:55:55,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 197 [2025-03-03 18:55:55,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:55:55,173 INFO L225 Difference]: With dead ends: 534 [2025-03-03 18:55:55,173 INFO L226 Difference]: Without dead ends: 329 [2025-03-03 18:55:55,173 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-03-03 18:55:55,174 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 58 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:55:55,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 250 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:55:55,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-03-03 18:55:55,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 325. [2025-03-03 18:55:55,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 215 states have (on average 1.302325581395349) internal successors, (280), 220 states have internal predecessors, (280), 102 states have call successors, (102), 7 states have call predecessors, (102), 7 states have return successors, (102), 97 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 18:55:55,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 484 transitions. [2025-03-03 18:55:55,204 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 484 transitions. Word has length 197 [2025-03-03 18:55:55,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:55:55,204 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 484 transitions. [2025-03-03 18:55:55,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 18:55:55,204 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 484 transitions. [2025-03-03 18:55:55,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 18:55:55,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:55:55,205 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:55:55,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 18:55:55,205 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:55:55,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:55:55,206 INFO L85 PathProgramCache]: Analyzing trace with hash -783188427, now seen corresponding path program 1 times [2025-03-03 18:55:55,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:55:55,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790625493] [2025-03-03 18:55:55,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:55:55,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:55:55,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 18:55:55,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 18:55:55,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:55:55,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:55:58,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 18:55:58,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:55:58,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790625493] [2025-03-03 18:55:58,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790625493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:55:58,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:55:58,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 18:55:58,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195422141] [2025-03-03 18:55:58,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:55:58,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:55:58,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:55:58,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:55:58,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:55:58,744 INFO L87 Difference]: Start difference. First operand 325 states and 484 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 18:55:59,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:55:59,055 INFO L93 Difference]: Finished difference Result 742 states and 1093 transitions. [2025-03-03 18:55:59,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:55:59,056 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 197 [2025-03-03 18:55:59,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:55:59,059 INFO L225 Difference]: With dead ends: 742 [2025-03-03 18:55:59,059 INFO L226 Difference]: Without dead ends: 434 [2025-03-03 18:55:59,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:55:59,060 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 94 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:55:59,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 337 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:55:59,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-03-03 18:55:59,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 359. [2025-03-03 18:55:59,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 249 states have (on average 1.3092369477911647) internal successors, (326), 254 states have internal predecessors, (326), 102 states have call successors, (102), 7 states have call predecessors, (102), 7 states have return successors, (102), 97 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 18:55:59,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 530 transitions. [2025-03-03 18:55:59,099 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 530 transitions. Word has length 197 [2025-03-03 18:55:59,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:55:59,099 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 530 transitions. [2025-03-03 18:55:59,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 18:55:59,100 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 530 transitions. [2025-03-03 18:55:59,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 18:55:59,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:55:59,101 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:55:59,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 18:55:59,101 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:55:59,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:55:59,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1076591434, now seen corresponding path program 1 times [2025-03-03 18:55:59,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:55:59,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449490646] [2025-03-03 18:55:59,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:55:59,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:55:59,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 18:55:59,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 18:55:59,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:55:59,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:56:02,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 18:56:02,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:56:02,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449490646] [2025-03-03 18:56:02,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449490646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:56:02,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:56:02,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 18:56:02,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508886685] [2025-03-03 18:56:02,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:56:02,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:56:02,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:56:02,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:56:02,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:56:02,571 INFO L87 Difference]: Start difference. First operand 359 states and 530 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 18:56:02,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:56:02,918 INFO L93 Difference]: Finished difference Result 744 states and 1096 transitions. [2025-03-03 18:56:02,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:56:02,919 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 197 [2025-03-03 18:56:02,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:56:02,922 INFO L225 Difference]: With dead ends: 744 [2025-03-03 18:56:02,922 INFO L226 Difference]: Without dead ends: 402 [2025-03-03 18:56:02,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:56:02,924 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 78 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:56:02,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 470 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:56:02,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-03-03 18:56:02,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 346. [2025-03-03 18:56:02,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 236 states have (on average 1.305084745762712) internal successors, (308), 241 states have internal predecessors, (308), 102 states have call successors, (102), 7 states have call predecessors, (102), 7 states have return successors, (102), 97 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 18:56:02,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 512 transitions. [2025-03-03 18:56:02,961 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 512 transitions. Word has length 197 [2025-03-03 18:56:02,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:56:02,962 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 512 transitions. [2025-03-03 18:56:02,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 18:56:02,962 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 512 transitions. [2025-03-03 18:56:02,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 18:56:02,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:56:02,964 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:56:02,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 18:56:02,964 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:56:02,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:56:02,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1482541195, now seen corresponding path program 1 times [2025-03-03 18:56:02,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:56:02,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039489454] [2025-03-03 18:56:02,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:56:02,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:56:02,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 18:56:03,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 18:56:03,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:56:03,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:56:05,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 18:56:05,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:56:05,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039489454] [2025-03-03 18:56:05,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039489454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:56:05,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:56:05,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 18:56:05,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143022135] [2025-03-03 18:56:05,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:56:05,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 18:56:05,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:56:05,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 18:56:05,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:56:05,837 INFO L87 Difference]: Start difference. First operand 346 states and 512 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 18:56:06,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:56:06,653 INFO L93 Difference]: Finished difference Result 808 states and 1189 transitions. [2025-03-03 18:56:06,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:56:06,654 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 197 [2025-03-03 18:56:06,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:56:06,657 INFO L225 Difference]: With dead ends: 808 [2025-03-03 18:56:06,657 INFO L226 Difference]: Without dead ends: 479 [2025-03-03 18:56:06,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:56:06,659 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 155 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:56:06,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 869 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:56:06,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-03-03 18:56:06,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 388. [2025-03-03 18:56:06,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 278 states have (on average 1.3237410071942446) internal successors, (368), 283 states have internal predecessors, (368), 102 states have call successors, (102), 7 states have call predecessors, (102), 7 states have return successors, (102), 97 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 18:56:06,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 572 transitions. [2025-03-03 18:56:06,698 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 572 transitions. Word has length 197 [2025-03-03 18:56:06,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:56:06,699 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 572 transitions. [2025-03-03 18:56:06,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 18:56:06,699 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 572 transitions. [2025-03-03 18:56:06,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 18:56:06,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:56:06,700 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:56:06,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 18:56:06,700 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:56:06,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:56:06,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1015474742, now seen corresponding path program 1 times [2025-03-03 18:56:06,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:56:06,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982534075] [2025-03-03 18:56:06,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:56:06,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:56:06,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 18:56:06,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 18:56:06,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:56:06,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:56:09,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 18:56:09,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:56:09,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982534075] [2025-03-03 18:56:09,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982534075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:56:09,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:56:09,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:56:09,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365380379] [2025-03-03 18:56:09,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:56:09,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:56:09,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:56:09,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:56:09,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:56:09,549 INFO L87 Difference]: Start difference. First operand 388 states and 572 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 18:56:10,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:56:10,266 INFO L93 Difference]: Finished difference Result 850 states and 1237 transitions. [2025-03-03 18:56:10,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:56:10,267 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 197 [2025-03-03 18:56:10,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:56:10,270 INFO L225 Difference]: With dead ends: 850 [2025-03-03 18:56:10,271 INFO L226 Difference]: Without dead ends: 479 [2025-03-03 18:56:10,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:56:10,272 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 166 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:56:10,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 613 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:56:10,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-03-03 18:56:10,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 388. [2025-03-03 18:56:10,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 278 states have (on average 1.3237410071942446) internal successors, (368), 283 states have internal predecessors, (368), 102 states have call successors, (102), 7 states have call predecessors, (102), 7 states have return successors, (102), 97 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 18:56:10,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 572 transitions. [2025-03-03 18:56:10,309 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 572 transitions. Word has length 197 [2025-03-03 18:56:10,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:56:10,309 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 572 transitions. [2025-03-03 18:56:10,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 18:56:10,310 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 572 transitions. [2025-03-03 18:56:10,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 18:56:10,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:56:10,310 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:56:10,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 18:56:10,311 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:56:10,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:56:10,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1988099820, now seen corresponding path program 1 times [2025-03-03 18:56:10,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:56:10,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134453336] [2025-03-03 18:56:10,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:56:10,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:56:10,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 18:56:10,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 18:56:10,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:56:10,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:56:12,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 18:56:12,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:56:12,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134453336] [2025-03-03 18:56:12,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134453336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:56:12,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:56:12,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:56:12,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559654814] [2025-03-03 18:56:12,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:56:12,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:56:12,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:56:12,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:56:12,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:56:12,187 INFO L87 Difference]: Start difference. First operand 388 states and 572 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 18:56:12,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:56:12,737 INFO L93 Difference]: Finished difference Result 850 states and 1237 transitions. [2025-03-03 18:56:12,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:56:12,738 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 197 [2025-03-03 18:56:12,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:56:12,743 INFO L225 Difference]: With dead ends: 850 [2025-03-03 18:56:12,744 INFO L226 Difference]: Without dead ends: 479 [2025-03-03 18:56:12,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:56:12,747 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 146 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:56:12,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 617 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:56:12,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-03-03 18:56:12,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 388. [2025-03-03 18:56:12,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 278 states have (on average 1.3237410071942446) internal successors, (368), 283 states have internal predecessors, (368), 102 states have call successors, (102), 7 states have call predecessors, (102), 7 states have return successors, (102), 97 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 18:56:12,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 572 transitions. [2025-03-03 18:56:12,794 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 572 transitions. Word has length 197 [2025-03-03 18:56:12,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:56:12,794 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 572 transitions. [2025-03-03 18:56:12,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 18:56:12,794 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 572 transitions. [2025-03-03 18:56:12,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 18:56:12,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:56:12,795 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:56:12,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 18:56:12,796 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:56:12,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:56:12,796 INFO L85 PathProgramCache]: Analyzing trace with hash 509916117, now seen corresponding path program 1 times [2025-03-03 18:56:12,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:56:12,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638529199] [2025-03-03 18:56:12,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:56:12,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:56:12,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 18:56:12,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 18:56:12,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:56:12,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:56:15,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 18:56:15,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:56:15,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638529199] [2025-03-03 18:56:15,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638529199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:56:15,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:56:15,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 18:56:15,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146796004] [2025-03-03 18:56:15,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:56:15,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 18:56:15,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:56:15,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 18:56:15,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:56:15,141 INFO L87 Difference]: Start difference. First operand 388 states and 572 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 18:56:15,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:56:15,803 INFO L93 Difference]: Finished difference Result 850 states and 1235 transitions. [2025-03-03 18:56:15,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:56:15,804 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 197 [2025-03-03 18:56:15,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:56:15,806 INFO L225 Difference]: With dead ends: 850 [2025-03-03 18:56:15,806 INFO L226 Difference]: Without dead ends: 479 [2025-03-03 18:56:15,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:56:15,809 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 132 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:56:15,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 908 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:56:15,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-03-03 18:56:15,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 371. [2025-03-03 18:56:15,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 261 states have (on average 1.314176245210728) internal successors, (343), 266 states have internal predecessors, (343), 102 states have call successors, (102), 7 states have call predecessors, (102), 7 states have return successors, (102), 97 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 18:56:15,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 547 transitions. [2025-03-03 18:56:15,846 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 547 transitions. Word has length 197 [2025-03-03 18:56:15,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:56:15,846 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 547 transitions. [2025-03-03 18:56:15,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 18:56:15,847 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 547 transitions. [2025-03-03 18:56:15,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 18:56:15,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:56:15,848 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:56:15,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 18:56:15,849 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:56:15,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:56:15,849 INFO L85 PathProgramCache]: Analyzing trace with hash -599809196, now seen corresponding path program 1 times [2025-03-03 18:56:15,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:56:15,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239616164] [2025-03-03 18:56:15,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:56:15,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:56:15,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 18:56:15,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 18:56:15,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:56:15,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:56:34,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 18:56:34,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:56:34,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239616164] [2025-03-03 18:56:34,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239616164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:56:34,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:56:34,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 18:56:34,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156297658] [2025-03-03 18:56:34,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:56:34,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 18:56:34,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:56:34,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 18:56:34,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:56:34,383 INFO L87 Difference]: Start difference. First operand 371 states and 547 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 18:56:35,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:56:35,435 INFO L93 Difference]: Finished difference Result 544 states and 785 transitions. [2025-03-03 18:56:35,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:56:35,436 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2025-03-03 18:56:35,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:56:35,438 INFO L225 Difference]: With dead ends: 544 [2025-03-03 18:56:35,438 INFO L226 Difference]: Without dead ends: 542 [2025-03-03 18:56:35,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:56:35,439 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 117 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:56:35,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1128 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:56:35,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-03-03 18:56:35,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 539. [2025-03-03 18:56:35,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 376 states have (on average 1.2712765957446808) internal successors, (478), 385 states have internal predecessors, (478), 150 states have call successors, (150), 12 states have call predecessors, (150), 12 states have return successors, (150), 141 states have call predecessors, (150), 150 states have call successors, (150) [2025-03-03 18:56:35,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 778 transitions. [2025-03-03 18:56:35,509 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 778 transitions. Word has length 198 [2025-03-03 18:56:35,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:56:35,509 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 778 transitions. [2025-03-03 18:56:35,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 18:56:35,509 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 778 transitions. [2025-03-03 18:56:35,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 18:56:35,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:56:35,510 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:56:35,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 18:56:35,510 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:56:35,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:56:35,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1427402922, now seen corresponding path program 1 times [2025-03-03 18:56:35,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:56:35,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089909407] [2025-03-03 18:56:35,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:56:35,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:56:35,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 18:56:35,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 18:56:35,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:56:35,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat