./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-34.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 18633f06cbfcb2d86a624bf68270d8235f3d798bef0344c8b1ebe935e6a76a6f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:31:26,652 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:31:26,697 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 22:31:26,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:31:26,701 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:31:26,718 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:31:26,719 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:31:26,719 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:31:26,720 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:31:26,721 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:31:26,721 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:31:26,721 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:31:26,721 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:31:26,721 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:31:26,721 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:31:26,721 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:31:26,722 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:31:26,722 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:31:26,722 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:31:26,722 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:31:26,722 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:31:26,723 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:31:26,723 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:31:26,723 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:31:26,723 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:31:26,723 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:31:26,723 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:31:26,723 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:31:26,723 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:31:26,723 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:31:26,723 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:31:26,723 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:31:26,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:31:26,724 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:31:26,724 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:31:26,724 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:31:26,724 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:31:26,724 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:31:26,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:31:26,725 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:31:26,725 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:31:26,725 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:31:26,725 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:31:26,725 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 18633f06cbfcb2d86a624bf68270d8235f3d798bef0344c8b1ebe935e6a76a6f [2025-02-05 22:31:26,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:31:26,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:31:26,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:31:26,952 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:31:26,952 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:31:26,953 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-34.i [2025-02-05 22:31:28,240 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d62b7b2e8/91b67ed64b44452c974a8e8a13ab124c/FLAG3a512ab97 [2025-02-05 22:31:28,544 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:31:28,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-34.i [2025-02-05 22:31:28,561 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d62b7b2e8/91b67ed64b44452c974a8e8a13ab124c/FLAG3a512ab97 [2025-02-05 22:31:28,575 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d62b7b2e8/91b67ed64b44452c974a8e8a13ab124c [2025-02-05 22:31:28,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:31:28,578 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:31:28,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:31:28,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:31:28,582 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:31:28,583 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:31:28" (1/1) ... [2025-02-05 22:31:28,584 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c8efec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:28, skipping insertion in model container [2025-02-05 22:31:28,584 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:31:28" (1/1) ... [2025-02-05 22:31:28,599 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:31:28,701 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-34.i[919,932] [2025-02-05 22:31:28,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:31:28,758 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:31:28,765 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-34.i[919,932] [2025-02-05 22:31:28,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:31:28,798 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:31:28,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:28 WrapperNode [2025-02-05 22:31:28,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:31:28,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:31:28,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:31:28,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:31:28,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:28" (1/1) ... [2025-02-05 22:31:28,812 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:28" (1/1) ... [2025-02-05 22:31:28,839 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 263 [2025-02-05 22:31:28,840 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:31:28,840 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:31:28,840 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:31:28,840 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:31:28,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:28" (1/1) ... [2025-02-05 22:31:28,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:28" (1/1) ... [2025-02-05 22:31:28,849 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:28" (1/1) ... [2025-02-05 22:31:28,866 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 22:31:28,866 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:28" (1/1) ... [2025-02-05 22:31:28,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:28" (1/1) ... [2025-02-05 22:31:28,873 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:28" (1/1) ... [2025-02-05 22:31:28,879 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:28" (1/1) ... [2025-02-05 22:31:28,881 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:28" (1/1) ... [2025-02-05 22:31:28,882 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:28" (1/1) ... [2025-02-05 22:31:28,884 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:31:28,885 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:31:28,885 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:31:28,885 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:31:28,886 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:28" (1/1) ... [2025-02-05 22:31:28,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:31:28,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:31:28,909 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 22:31:28,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 22:31:28,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:31:28,930 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:31:28,930 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:31:28,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:31:28,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:31:28,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:31:28,986 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:31:28,987 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:31:29,375 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L205: havoc property_#t~bitwise24#1;havoc property_#t~ite26#1;havoc property_#t~bitwise25#1;havoc property_#t~short27#1; [2025-02-05 22:31:29,410 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-02-05 22:31:29,410 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:31:29,424 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:31:29,425 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:31:29,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:31:29 BoogieIcfgContainer [2025-02-05 22:31:29,425 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:31:29,427 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:31:29,427 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:31:29,430 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:31:29,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:31:28" (1/3) ... [2025-02-05 22:31:29,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f19ec13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:31:29, skipping insertion in model container [2025-02-05 22:31:29,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:31:28" (2/3) ... [2025-02-05 22:31:29,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f19ec13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:31:29, skipping insertion in model container [2025-02-05 22:31:29,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:31:29" (3/3) ... [2025-02-05 22:31:29,432 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-34.i [2025-02-05 22:31:29,442 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:31:29,444 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-34.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:31:29,487 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:31:29,498 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;@10201a81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:31:29,500 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:31:29,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 76 states have internal predecessors, (110), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-05 22:31:29,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-02-05 22:31:29,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:31:29,516 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:31:29,516 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:31:29,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:31:29,520 INFO L85 PathProgramCache]: Analyzing trace with hash -2046406045, now seen corresponding path program 1 times [2025-02-05 22:31:29,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:31:29,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3647334] [2025-02-05 22:31:29,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:31:29,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:31:29,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-05 22:31:29,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-05 22:31:29,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:31:29,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:31:29,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-02-05 22:31:29,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:31:29,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3647334] [2025-02-05 22:31:29,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3647334] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:31:29,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052055083] [2025-02-05 22:31:29,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:31:29,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:31:29,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:31:29,792 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:31:29,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 22:31:29,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-05 22:31:29,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-05 22:31:29,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:31:29,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:31:29,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:31:29,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:31:29,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-02-05 22:31:29,979 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:31:29,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052055083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:31:29,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:31:29,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:31:29,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667769691] [2025-02-05 22:31:29,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:31:29,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:31:29,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:31:30,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:31:30,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:31:30,008 INFO L87 Difference]: Start difference. First operand has 111 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 76 states have internal predecessors, (110), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-02-05 22:31:30,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:31:30,048 INFO L93 Difference]: Finished difference Result 216 states and 380 transitions. [2025-02-05 22:31:30,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:31:30,050 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 212 [2025-02-05 22:31:30,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:31:30,057 INFO L225 Difference]: With dead ends: 216 [2025-02-05 22:31:30,059 INFO L226 Difference]: Without dead ends: 108 [2025-02-05 22:31:30,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:31:30,066 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:31:30,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:31:30,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-05 22:31:30,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-02-05 22:31:30,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 73 states have internal predecessors, (105), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-05 22:31:30,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 171 transitions. [2025-02-05 22:31:30,112 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 171 transitions. Word has length 212 [2025-02-05 22:31:30,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:31:30,113 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 171 transitions. [2025-02-05 22:31:30,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-02-05 22:31:30,114 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 171 transitions. [2025-02-05 22:31:30,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-02-05 22:31:30,116 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:31:30,117 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:31:30,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 22:31:30,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 22:31:30,318 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:31:30,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:31:30,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1413352096, now seen corresponding path program 1 times [2025-02-05 22:31:30,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:31:30,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457451482] [2025-02-05 22:31:30,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:31:30,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:31:30,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-05 22:31:30,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-05 22:31:30,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:31:30,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:31:30,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-02-05 22:31:30,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:31:30,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457451482] [2025-02-05 22:31:30,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457451482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:31:30,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:31:30,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:31:30,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455347147] [2025-02-05 22:31:30,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:31:30,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:31:30,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:31:30,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:31:30,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:31:30,969 INFO L87 Difference]: Start difference. First operand 108 states and 171 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:31:31,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:31:31,207 INFO L93 Difference]: Finished difference Result 358 states and 571 transitions. [2025-02-05 22:31:31,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:31:31,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212 [2025-02-05 22:31:31,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:31:31,212 INFO L225 Difference]: With dead ends: 358 [2025-02-05 22:31:31,213 INFO L226 Difference]: Without dead ends: 253 [2025-02-05 22:31:31,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:31:31,215 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 178 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:31:31,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 536 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:31:31,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-02-05 22:31:31,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 213. [2025-02-05 22:31:31,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 144 states have (on average 1.4375) internal successors, (207), 144 states have internal predecessors, (207), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-05 22:31:31,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 339 transitions. [2025-02-05 22:31:31,263 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 339 transitions. Word has length 212 [2025-02-05 22:31:31,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:31:31,266 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 339 transitions. [2025-02-05 22:31:31,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:31:31,266 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 339 transitions. [2025-02-05 22:31:31,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-02-05 22:31:31,268 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:31:31,268 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:31:31,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:31:31,268 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:31:31,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:31:31,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1805529969, now seen corresponding path program 1 times [2025-02-05 22:31:31,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:31:31,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247148349] [2025-02-05 22:31:31,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:31:31,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:31:31,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-05 22:31:31,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-05 22:31:31,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:31:31,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:31:31,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-02-05 22:31:31,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:31:31,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247148349] [2025-02-05 22:31:31,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247148349] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:31:31,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:31:31,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:31:31,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087010412] [2025-02-05 22:31:31,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:31:31,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:31:31,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:31:31,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:31:31,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:31:31,649 INFO L87 Difference]: Start difference. First operand 213 states and 339 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:31:32,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:31:32,026 INFO L93 Difference]: Finished difference Result 628 states and 1000 transitions. [2025-02-05 22:31:32,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:31:32,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 213 [2025-02-05 22:31:32,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:31:32,034 INFO L225 Difference]: With dead ends: 628 [2025-02-05 22:31:32,035 INFO L226 Difference]: Without dead ends: 418 [2025-02-05 22:31:32,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:31:32,038 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 204 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:31:32,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 588 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:31:32,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-02-05 22:31:32,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 217. [2025-02-05 22:31:32,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 148 states have (on average 1.4256756756756757) internal successors, (211), 148 states have internal predecessors, (211), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-05 22:31:32,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 343 transitions. [2025-02-05 22:31:32,104 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 343 transitions. Word has length 213 [2025-02-05 22:31:32,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:31:32,106 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 343 transitions. [2025-02-05 22:31:32,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:31:32,108 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 343 transitions. [2025-02-05 22:31:32,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-05 22:31:32,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:31:32,110 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:31:32,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:31:32,113 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:31:32,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:31:32,114 INFO L85 PathProgramCache]: Analyzing trace with hash 898954824, now seen corresponding path program 1 times [2025-02-05 22:31:32,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:31:32,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562186920] [2025-02-05 22:31:32,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:31:32,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:31:32,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-05 22:31:32,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-05 22:31:32,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:31:32,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:32:06,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-02-05 22:32:06,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:32:06,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562186920] [2025-02-05 22:32:06,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562186920] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:32:06,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:32:06,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 22:32:06,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760646051] [2025-02-05 22:32:06,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:32:06,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 22:32:06,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:32:06,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 22:32:06,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-02-05 22:32:06,262 INFO L87 Difference]: Start difference. First operand 217 states and 343 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:32:08,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:32:08,220 INFO L93 Difference]: Finished difference Result 777 states and 1219 transitions. [2025-02-05 22:32:08,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 22:32:08,222 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-02-05 22:32:08,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:32:08,225 INFO L225 Difference]: With dead ends: 777 [2025-02-05 22:32:08,225 INFO L226 Difference]: Without dead ends: 563 [2025-02-05 22:32:08,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2025-02-05 22:32:08,232 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 780 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:32:08,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 1158 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 22:32:08,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-02-05 22:32:08,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 342. [2025-02-05 22:32:08,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 261 states have (on average 1.4827586206896552) internal successors, (387), 263 states have internal predecessors, (387), 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-02-05 22:32:08,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 539 transitions. [2025-02-05 22:32:08,291 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 539 transitions. Word has length 214 [2025-02-05 22:32:08,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:32:08,291 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 539 transitions. [2025-02-05 22:32:08,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:32:08,296 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 539 transitions. [2025-02-05 22:32:08,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-05 22:32:08,298 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:32:08,298 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:32:08,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 22:32:08,299 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:32:08,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:32:08,299 INFO L85 PathProgramCache]: Analyzing trace with hash 393396199, now seen corresponding path program 1 times [2025-02-05 22:32:08,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:32:08,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743170345] [2025-02-05 22:32:08,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:32:08,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:32:08,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-05 22:32:08,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-05 22:32:08,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:32:08,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:32:10,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-02-05 22:32:10,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:32:10,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743170345] [2025-02-05 22:32:10,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743170345] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:32:10,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:32:10,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 22:32:10,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881979023] [2025-02-05 22:32:10,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:32:10,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 22:32:10,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:32:10,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 22:32:10,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:32:10,336 INFO L87 Difference]: Start difference. First operand 342 states and 539 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:32:11,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:32:11,711 INFO L93 Difference]: Finished difference Result 1250 states and 1980 transitions. [2025-02-05 22:32:11,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 22:32:11,712 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-02-05 22:32:11,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:32:11,718 INFO L225 Difference]: With dead ends: 1250 [2025-02-05 22:32:11,718 INFO L226 Difference]: Without dead ends: 911 [2025-02-05 22:32:11,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-02-05 22:32:11,722 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 507 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:32:11,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 734 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 22:32:11,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2025-02-05 22:32:11,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 455. [2025-02-05 22:32:11,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 340 states have (on average 1.45) internal successors, (493), 342 states have internal predecessors, (493), 109 states have call successors, (109), 5 states have call predecessors, (109), 5 states have return successors, (109), 107 states have call predecessors, (109), 109 states have call successors, (109) [2025-02-05 22:32:11,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 711 transitions. [2025-02-05 22:32:11,763 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 711 transitions. Word has length 214 [2025-02-05 22:32:11,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:32:11,764 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 711 transitions. [2025-02-05 22:32:11,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:32:11,764 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 711 transitions. [2025-02-05 22:32:11,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-05 22:32:11,765 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:32:11,765 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:32:11,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 22:32:11,766 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:32:11,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:32:11,766 INFO L85 PathProgramCache]: Analyzing trace with hash 388420647, now seen corresponding path program 1 times [2025-02-05 22:32:11,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:32:11,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433225589] [2025-02-05 22:32:11,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:32:11,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:32:11,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-05 22:32:11,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-05 22:32:11,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:32:11,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:32:13,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-02-05 22:32:13,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:32:13,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433225589] [2025-02-05 22:32:13,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433225589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:32:13,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:32:13,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 22:32:13,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119320445] [2025-02-05 22:32:13,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:32:13,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 22:32:13,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:32:13,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 22:32:13,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:32:13,630 INFO L87 Difference]: Start difference. First operand 455 states and 711 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:32:14,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:32:14,748 INFO L93 Difference]: Finished difference Result 1314 states and 2061 transitions. [2025-02-05 22:32:14,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 22:32:14,749 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-02-05 22:32:14,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:32:14,753 INFO L225 Difference]: With dead ends: 1314 [2025-02-05 22:32:14,753 INFO L226 Difference]: Without dead ends: 926 [2025-02-05 22:32:14,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-02-05 22:32:14,755 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 468 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 22:32:14,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 779 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 22:32:14,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2025-02-05 22:32:14,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 750. [2025-02-05 22:32:14,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 635 states have (on average 1.5338582677165353) internal successors, (974), 637 states have internal predecessors, (974), 109 states have call successors, (109), 5 states have call predecessors, (109), 5 states have return successors, (109), 107 states have call predecessors, (109), 109 states have call successors, (109) [2025-02-05 22:32:14,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1192 transitions. [2025-02-05 22:32:14,796 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1192 transitions. Word has length 214 [2025-02-05 22:32:14,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:32:14,797 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 1192 transitions. [2025-02-05 22:32:14,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:32:14,797 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1192 transitions. [2025-02-05 22:32:14,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-05 22:32:14,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:32:14,800 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:32:14,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 22:32:14,800 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:32:14,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:32:14,801 INFO L85 PathProgramCache]: Analyzing trace with hash -72773501, now seen corresponding path program 1 times [2025-02-05 22:32:14,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:32:14,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742011673] [2025-02-05 22:32:14,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:32:14,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:32:14,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-05 22:32:14,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-05 22:32:14,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:32:14,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:32:15,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-02-05 22:32:15,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:32:15,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742011673] [2025-02-05 22:32:15,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742011673] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:32:15,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:32:15,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 22:32:15,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946338715] [2025-02-05 22:32:15,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:32:15,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 22:32:15,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:32:15,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 22:32:15,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:32:15,959 INFO L87 Difference]: Start difference. First operand 750 states and 1192 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:32:16,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:32:16,367 INFO L93 Difference]: Finished difference Result 1424 states and 2259 transitions. [2025-02-05 22:32:16,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 22:32:16,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-02-05 22:32:16,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:32:16,371 INFO L225 Difference]: With dead ends: 1424 [2025-02-05 22:32:16,372 INFO L226 Difference]: Without dead ends: 999 [2025-02-05 22:32:16,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-02-05 22:32:16,373 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 276 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:32:16,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 562 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:32:16,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2025-02-05 22:32:16,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 754. [2025-02-05 22:32:16,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 639 states have (on average 1.5258215962441315) internal successors, (975), 641 states have internal predecessors, (975), 109 states have call successors, (109), 5 states have call predecessors, (109), 5 states have return successors, (109), 107 states have call predecessors, (109), 109 states have call successors, (109) [2025-02-05 22:32:16,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1193 transitions. [2025-02-05 22:32:16,412 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1193 transitions. Word has length 214 [2025-02-05 22:32:16,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:32:16,413 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1193 transitions. [2025-02-05 22:32:16,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:32:16,413 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1193 transitions. [2025-02-05 22:32:16,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-05 22:32:16,415 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:32:16,415 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:32:16,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 22:32:16,415 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:32:16,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:32:16,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1110305737, now seen corresponding path program 1 times [2025-02-05 22:32:16,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:32:16,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466501104] [2025-02-05 22:32:16,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:32:16,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:32:16,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-05 22:32:16,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-05 22:32:16,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:32:16,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:32:16,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-02-05 22:32:16,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:32:16,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466501104] [2025-02-05 22:32:16,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466501104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:32:16,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:32:16,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:32:16,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571794562] [2025-02-05 22:32:16,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:32:16,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:32:16,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:32:16,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:32:16,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:32:16,687 INFO L87 Difference]: Start difference. First operand 754 states and 1193 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:32:16,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:32:16,940 INFO L93 Difference]: Finished difference Result 1253 states and 1986 transitions. [2025-02-05 22:32:16,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:32:16,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-02-05 22:32:16,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:32:16,944 INFO L225 Difference]: With dead ends: 1253 [2025-02-05 22:32:16,944 INFO L226 Difference]: Without dead ends: 738 [2025-02-05 22:32:16,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:32:16,946 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 111 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:32:16,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 438 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:32:16,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2025-02-05 22:32:16,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 684. [2025-02-05 22:32:16,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 569 states have (on average 1.4973637961335677) internal successors, (852), 571 states have internal predecessors, (852), 109 states have call successors, (109), 5 states have call predecessors, (109), 5 states have return successors, (109), 107 states have call predecessors, (109), 109 states have call successors, (109) [2025-02-05 22:32:16,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1070 transitions. [2025-02-05 22:32:16,986 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1070 transitions. Word has length 214 [2025-02-05 22:32:16,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:32:16,986 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 1070 transitions. [2025-02-05 22:32:16,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:32:16,987 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1070 transitions. [2025-02-05 22:32:16,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-05 22:32:16,988 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:32:16,988 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:32:16,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 22:32:16,988 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:32:16,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:32:16,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2143719305, now seen corresponding path program 1 times [2025-02-05 22:32:16,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:32:16,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139030822] [2025-02-05 22:32:16,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:32:16,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:32:16,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-05 22:32:17,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-05 22:32:17,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:32:17,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:32:29,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-02-05 22:32:29,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:32:29,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139030822] [2025-02-05 22:32:29,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139030822] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:32:29,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:32:29,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 22:32:29,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018635450] [2025-02-05 22:32:29,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:32:29,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 22:32:29,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:32:29,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 22:32:29,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-02-05 22:32:29,770 INFO L87 Difference]: Start difference. First operand 684 states and 1070 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:32:32,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:32:32,715 INFO L93 Difference]: Finished difference Result 970 states and 1499 transitions. [2025-02-05 22:32:32,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 22:32:32,716 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-02-05 22:32:32,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:32:32,719 INFO L225 Difference]: With dead ends: 970 [2025-02-05 22:32:32,719 INFO L226 Difference]: Without dead ends: 798 [2025-02-05 22:32:32,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=145, Invalid=557, Unknown=0, NotChecked=0, Total=702 [2025-02-05 22:32:32,720 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 330 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 22:32:32,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1533 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 22:32:32,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2025-02-05 22:32:32,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 699. [2025-02-05 22:32:32,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 584 states have (on average 1.5) internal successors, (876), 586 states have internal predecessors, (876), 109 states have call successors, (109), 5 states have call predecessors, (109), 5 states have return successors, (109), 107 states have call predecessors, (109), 109 states have call successors, (109) [2025-02-05 22:32:32,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1094 transitions. [2025-02-05 22:32:32,760 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1094 transitions. Word has length 214 [2025-02-05 22:32:32,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:32:32,761 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 1094 transitions. [2025-02-05 22:32:32,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 22:32:32,761 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1094 transitions. [2025-02-05 22:32:32,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-05 22:32:32,762 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:32:32,762 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:32:32,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 22:32:32,763 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:32:32,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:32:32,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1886696877, now seen corresponding path program 1 times [2025-02-05 22:32:32,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:32:32,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571432813] [2025-02-05 22:32:32,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:32:32,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:32:32,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 22:32:32,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 22:32:32,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:32:32,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat