./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-10.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 73a02241f62dd5f03e40960bce3ebc0277b0698412736895e26f9644edb13c8b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:11:19,326 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:11:19,374 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:11:19,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:11:19,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:11:19,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:11:19,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:11:19,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:11:19,407 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:11:19,407 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:11:19,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:11:19,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:11:19,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:11:19,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:11:19,409 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:11:19,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:11:19,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:11:19,409 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:11:19,409 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:11:19,409 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:11:19,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:11:19,409 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:11:19,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:11:19,410 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:11:19,410 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:11:19,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:11:19,410 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:11:19,410 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:11:19,410 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:11:19,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:11:19,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:11:19,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:11:19,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:11:19,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:11:19,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:11:19,411 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:11:19,411 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:11:19,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:11:19,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:11:19,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:11:19,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:11:19,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:11:19,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:11:19,412 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 73a02241f62dd5f03e40960bce3ebc0277b0698412736895e26f9644edb13c8b [2025-03-03 21:11:19,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:11:19,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:11:19,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:11:19,729 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:11:19,729 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:11:19,731 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-10.i [2025-03-03 21:11:20,868 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f4f938dd/ad928bad228a4fd099e1f3b510835be2/FLAG2849be9ff [2025-03-03 21:11:21,094 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:11:21,095 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-10.i [2025-03-03 21:11:21,104 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f4f938dd/ad928bad228a4fd099e1f3b510835be2/FLAG2849be9ff [2025-03-03 21:11:21,447 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f4f938dd/ad928bad228a4fd099e1f3b510835be2 [2025-03-03 21:11:21,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:11:21,452 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:11:21,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:11:21,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:11:21,457 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:11:21,458 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:11:21" (1/1) ... [2025-03-03 21:11:21,459 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@545ba4e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:11:21, skipping insertion in model container [2025-03-03 21:11:21,459 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:11:21" (1/1) ... [2025-03-03 21:11:21,490 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:11:21,618 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-10.i[919,932] [2025-03-03 21:11:21,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:11:21,721 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:11:21,730 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-10.i[919,932] [2025-03-03 21:11:21,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:11:21,790 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:11:21,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:11:21 WrapperNode [2025-03-03 21:11:21,791 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:11:21,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:11:21,792 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:11:21,792 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:11:21,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:11:21" (1/1) ... [2025-03-03 21:11:21,811 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:11:21" (1/1) ... [2025-03-03 21:11:21,846 INFO L138 Inliner]: procedures = 26, calls = 61, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 334 [2025-03-03 21:11:21,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:11:21,850 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:11:21,850 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:11:21,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:11:21,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:11:21" (1/1) ... [2025-03-03 21:11:21,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:11:21" (1/1) ... [2025-03-03 21:11:21,865 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:11:21" (1/1) ... [2025-03-03 21:11:21,890 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:11:21,891 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:11:21" (1/1) ... [2025-03-03 21:11:21,891 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:11:21" (1/1) ... [2025-03-03 21:11:21,900 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:11:21" (1/1) ... [2025-03-03 21:11:21,901 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:11:21" (1/1) ... [2025-03-03 21:11:21,902 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:11:21" (1/1) ... [2025-03-03 21:11:21,908 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:11:21" (1/1) ... [2025-03-03 21:11:21,915 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:11:21,915 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:11:21,915 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:11:21,915 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:11:21,918 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:11:21" (1/1) ... [2025-03-03 21:11:21,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:11:21,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:11:21,945 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:11:21,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:11:21,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:11:21,964 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:11:21,964 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:11:21,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:11:21,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:11:21,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:11:22,025 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:11:22,026 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:11:22,503 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L223: havoc property_#t~bitwise38#1;havoc property_#t~ite40#1;havoc property_#t~bitwise39#1;havoc property_#t~short41#1; [2025-03-03 21:11:22,557 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-03-03 21:11:22,557 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:11:22,576 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:11:22,576 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:11:22,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:11:22 BoogieIcfgContainer [2025-03-03 21:11:22,577 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:11:22,578 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:11:22,578 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:11:22,581 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:11:22,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:11:21" (1/3) ... [2025-03-03 21:11:22,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72adf97a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:11:22, skipping insertion in model container [2025-03-03 21:11:22,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:11:21" (2/3) ... [2025-03-03 21:11:22,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72adf97a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:11:22, skipping insertion in model container [2025-03-03 21:11:22,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:11:22" (3/3) ... [2025-03-03 21:11:22,583 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-10.i [2025-03-03 21:11:22,593 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:11:22,595 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-10.i that has 2 procedures, 145 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:11:22,635 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:11:22,642 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;@7461c751, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:11:22,643 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:11:22,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 95 states have internal predecessors, (133), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 21:11:22,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-03-03 21:11:22,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:11:22,656 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:11:22,657 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:11:22,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:11:22,660 INFO L85 PathProgramCache]: Analyzing trace with hash 328453585, now seen corresponding path program 1 times [2025-03-03 21:11:22,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:11:22,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233565429] [2025-03-03 21:11:22,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:11:22,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:11:22,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-03 21:11:22,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-03 21:11:22,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:11:22,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:11:22,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2025-03-03 21:11:22,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:11:22,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233565429] [2025-03-03 21:11:22,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233565429] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:11:22,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642828522] [2025-03-03 21:11:22,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:11:22,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:11:22,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:11:22,994 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:11:22,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 21:11:23,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-03 21:11:23,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-03 21:11:23,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:11:23,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:11:23,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:11:23,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:11:23,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2025-03-03 21:11:23,242 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:11:23,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642828522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:11:23,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:11:23,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:11:23,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238385659] [2025-03-03 21:11:23,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:11:23,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:11:23,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:11:23,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:11:23,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:11:23,261 INFO L87 Difference]: Start difference. First operand has 145 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 95 states have internal predecessors, (133), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-03 21:11:23,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:11:23,310 INFO L93 Difference]: Finished difference Result 284 states and 501 transitions. [2025-03-03 21:11:23,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:11:23,311 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 294 [2025-03-03 21:11:23,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:11:23,316 INFO L225 Difference]: With dead ends: 284 [2025-03-03 21:11:23,317 INFO L226 Difference]: Without dead ends: 142 [2025-03-03 21:11:23,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:11:23,324 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:11:23,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:11:23,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-03 21:11:23,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-03-03 21:11:23,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 92 states have (on average 1.391304347826087) internal successors, (128), 92 states have internal predecessors, (128), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 21:11:23,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 224 transitions. [2025-03-03 21:11:23,362 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 224 transitions. Word has length 294 [2025-03-03 21:11:23,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:11:23,362 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 224 transitions. [2025-03-03 21:11:23,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-03 21:11:23,362 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 224 transitions. [2025-03-03 21:11:23,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-03-03 21:11:23,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:11:23,366 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:11:23,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 21:11:23,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 21:11:23,568 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:11:23,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:11:23,568 INFO L85 PathProgramCache]: Analyzing trace with hash -2073207731, now seen corresponding path program 1 times [2025-03-03 21:11:23,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:11:23,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250716347] [2025-03-03 21:11:23,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:11:23,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:11:23,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-03 21:11:23,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-03 21:11:23,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:11:23,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:11:24,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-03 21:11:24,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:11:24,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250716347] [2025-03-03 21:11:24,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250716347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:11:24,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:11:24,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:11:24,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095496230] [2025-03-03 21:11:24,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:11:24,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:11:24,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:11:24,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:11:24,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:11:24,194 INFO L87 Difference]: Start difference. First operand 142 states and 224 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:11:24,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:11:24,452 INFO L93 Difference]: Finished difference Result 421 states and 667 transitions. [2025-03-03 21:11:24,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:11:24,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 294 [2025-03-03 21:11:24,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:11:24,457 INFO L225 Difference]: With dead ends: 421 [2025-03-03 21:11:24,457 INFO L226 Difference]: Without dead ends: 282 [2025-03-03 21:11:24,458 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-03-03 21:11:24,458 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 134 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:11:24,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 625 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:11:24,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-03 21:11:24,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 223. [2025-03-03 21:11:24,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 124 states have (on average 1.2903225806451613) internal successors, (160), 124 states have internal predecessors, (160), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-03 21:11:24,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 352 transitions. [2025-03-03 21:11:24,507 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 352 transitions. Word has length 294 [2025-03-03 21:11:24,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:11:24,508 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 352 transitions. [2025-03-03 21:11:24,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:11:24,508 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 352 transitions. [2025-03-03 21:11:24,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-03 21:11:24,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:11:24,512 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:11:24,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:11:24,512 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:11:24,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:11:24,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1961831888, now seen corresponding path program 1 times [2025-03-03 21:11:24,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:11:24,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549907446] [2025-03-03 21:11:24,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:11:24,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:11:24,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-03 21:11:24,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-03 21:11:24,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:11:24,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:12:11,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-03 21:12:11,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:12:11,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549907446] [2025-03-03 21:12:11,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549907446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:12:11,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:12:11,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 21:12:11,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894903274] [2025-03-03 21:12:11,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:12:11,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 21:12:11,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:12:11,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 21:12:11,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:12:11,122 INFO L87 Difference]: Start difference. First operand 223 states and 352 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:12:12,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:12:12,406 INFO L93 Difference]: Finished difference Result 632 states and 990 transitions. [2025-03-03 21:12:12,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 21:12:12,407 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 295 [2025-03-03 21:12:12,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:12:12,411 INFO L225 Difference]: With dead ends: 632 [2025-03-03 21:12:12,412 INFO L226 Difference]: Without dead ends: 493 [2025-03-03 21:12:12,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:12:12,413 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 384 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:12:12,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 1455 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 21:12:12,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-03-03 21:12:12,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 401. [2025-03-03 21:12:12,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 252 states have (on average 1.3611111111111112) internal successors, (343), 253 states have internal predecessors, (343), 144 states have call successors, (144), 4 states have call predecessors, (144), 4 states have return successors, (144), 143 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-03 21:12:12,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 631 transitions. [2025-03-03 21:12:12,470 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 631 transitions. Word has length 295 [2025-03-03 21:12:12,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:12:12,471 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 631 transitions. [2025-03-03 21:12:12,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:12:12,472 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 631 transitions. [2025-03-03 21:12:12,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-03 21:12:12,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:12:12,475 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:12:12,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:12:12,475 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:12:12,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:12:12,476 INFO L85 PathProgramCache]: Analyzing trace with hash -842694928, now seen corresponding path program 1 times [2025-03-03 21:12:12,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:12:12,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854624923] [2025-03-03 21:12:12,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:12:12,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:12:12,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-03 21:12:12,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-03 21:12:12,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:12:12,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:12:28,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-03 21:12:28,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:12:28,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854624923] [2025-03-03 21:12:28,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854624923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:12:28,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:12:28,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 21:12:28,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920688473] [2025-03-03 21:12:28,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:12:28,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 21:12:28,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:12:28,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 21:12:28,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-03-03 21:12:28,285 INFO L87 Difference]: Start difference. First operand 401 states and 631 transitions. Second operand has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 3 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 3 states have call predecessors, (48), 3 states have call successors, (48) [2025-03-03 21:12:32,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:12:32,408 INFO L93 Difference]: Finished difference Result 911 states and 1381 transitions. [2025-03-03 21:12:32,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 21:12:32,408 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 3 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 3 states have call predecessors, (48), 3 states have call successors, (48) Word has length 295 [2025-03-03 21:12:32,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:12:32,413 INFO L225 Difference]: With dead ends: 911 [2025-03-03 21:12:32,413 INFO L226 Difference]: Without dead ends: 592 [2025-03-03 21:12:32,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2025-03-03 21:12:32,415 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 965 mSDsluCounter, 1675 mSDsCounter, 0 mSdLazyCounter, 1898 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 1907 SdHoareTripleChecker+Invalid, 2107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:12:32,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 1907 Invalid, 2107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1898 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 21:12:32,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-03 21:12:32,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 430. [2025-03-03 21:12:32,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 277 states have (on average 1.3465703971119134) internal successors, (373), 278 states have internal predecessors, (373), 144 states have call successors, (144), 8 states have call predecessors, (144), 8 states have return successors, (144), 143 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-03 21:12:32,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 661 transitions. [2025-03-03 21:12:32,444 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 661 transitions. Word has length 295 [2025-03-03 21:12:32,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:12:32,444 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 661 transitions. [2025-03-03 21:12:32,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 3 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 3 states have call predecessors, (48), 3 states have call successors, (48) [2025-03-03 21:12:32,445 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 661 transitions. [2025-03-03 21:12:32,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-03 21:12:32,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:12:32,446 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:12:32,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:12:32,446 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:12:32,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:12:32,447 INFO L85 PathProgramCache]: Analyzing trace with hash -359150063, now seen corresponding path program 1 times [2025-03-03 21:12:32,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:12:32,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698936047] [2025-03-03 21:12:32,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:12:32,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:12:32,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-03 21:12:32,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-03 21:12:32,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:12:32,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:12:42,738 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-03 21:12:42,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:12:42,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698936047] [2025-03-03 21:12:42,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698936047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:12:42,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:12:42,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 21:12:42,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080472241] [2025-03-03 21:12:42,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:12:42,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 21:12:42,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:12:42,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 21:12:42,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:12:42,740 INFO L87 Difference]: Start difference. First operand 430 states and 661 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-03 21:12:43,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:12:43,772 INFO L93 Difference]: Finished difference Result 879 states and 1340 transitions. [2025-03-03 21:12:43,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 21:12:43,773 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 295 [2025-03-03 21:12:43,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:12:43,777 INFO L225 Difference]: With dead ends: 879 [2025-03-03 21:12:43,777 INFO L226 Difference]: Without dead ends: 539 [2025-03-03 21:12:43,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2025-03-03 21:12:43,778 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 455 mSDsluCounter, 1296 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 21:12:43,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1550 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 21:12:43,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-03 21:12:43,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 419. [2025-03-03 21:12:43,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 266 states have (on average 1.3421052631578947) internal successors, (357), 267 states have internal predecessors, (357), 144 states have call successors, (144), 8 states have call predecessors, (144), 8 states have return successors, (144), 143 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-03 21:12:43,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 645 transitions. [2025-03-03 21:12:43,809 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 645 transitions. Word has length 295 [2025-03-03 21:12:43,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:12:43,809 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 645 transitions. [2025-03-03 21:12:43,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-03 21:12:43,810 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 645 transitions. [2025-03-03 21:12:43,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-03 21:12:43,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:12:43,811 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:12:43,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:12:43,812 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:12:43,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:12:43,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1088370927, now seen corresponding path program 1 times [2025-03-03 21:12:43,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:12:43,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308677080] [2025-03-03 21:12:43,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:12:43,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:12:43,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-03 21:12:43,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-03 21:12:43,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:12:43,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:12:53,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-03 21:12:53,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:12:53,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308677080] [2025-03-03 21:12:53,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308677080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:12:53,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:12:53,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 21:12:53,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662568563] [2025-03-03 21:12:53,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:12:53,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 21:12:53,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:12:53,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 21:12:53,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:12:53,222 INFO L87 Difference]: Start difference. First operand 419 states and 645 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:12:53,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:12:53,896 INFO L93 Difference]: Finished difference Result 770 states and 1192 transitions. [2025-03-03 21:12:53,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 21:12:53,896 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 295 [2025-03-03 21:12:53,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:12:53,900 INFO L225 Difference]: With dead ends: 770 [2025-03-03 21:12:53,900 INFO L226 Difference]: Without dead ends: 631 [2025-03-03 21:12:53,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:12:53,901 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 474 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:12:53,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 1124 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:12:53,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-03-03 21:12:53,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 596. [2025-03-03 21:12:53,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 393 states have (on average 1.3740458015267176) internal successors, (540), 394 states have internal predecessors, (540), 192 states have call successors, (192), 10 states have call predecessors, (192), 10 states have return successors, (192), 191 states have call predecessors, (192), 192 states have call successors, (192) [2025-03-03 21:12:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 924 transitions. [2025-03-03 21:12:53,939 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 924 transitions. Word has length 295 [2025-03-03 21:12:53,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:12:53,940 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 924 transitions. [2025-03-03 21:12:53,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-03 21:12:53,940 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 924 transitions. [2025-03-03 21:12:53,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-03 21:12:53,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:12:53,941 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:12:53,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:12:53,942 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:12:53,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:12:53,942 INFO L85 PathProgramCache]: Analyzing trace with hash 402069553, now seen corresponding path program 1 times [2025-03-03 21:12:53,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:12:53,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126073631] [2025-03-03 21:12:53,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:12:53,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:12:53,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-03 21:12:54,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-03 21:12:54,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:12:54,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat