./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-ps-ci_file-34.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 8509af5ddea8b4969815a398e5f07c16448270bd1737b92218393c93b8a3a0c1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:56:20,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:56:20,070 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:56:20,076 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:56:20,076 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:56:20,096 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:56:20,098 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:56:20,098 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:56:20,099 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:56:20,099 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:56:20,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:56:20,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:56:20,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:56:20,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:56:20,100 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:56:20,101 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:56:20,101 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:56:20,101 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:56:20,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:56:20,102 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:56:20,102 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:56:20,102 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:56:20,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:56:20,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:56:20,102 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:56:20,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:56:20,102 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:56:20,102 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:56:20,103 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:56:20,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:56:20,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:56:20,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:56:20,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:56:20,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:56:20,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:56:20,104 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:56:20,104 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:56:20,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:56:20,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:56:20,105 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:56:20,105 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:56:20,105 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:56:20,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:56:20,105 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 -> 8509af5ddea8b4969815a398e5f07c16448270bd1737b92218393c93b8a3a0c1 [2025-03-17 01:56:20,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:56:20,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:56:20,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:56:20,341 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:56:20,341 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:56:20,343 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-ps-ci_file-34.i [2025-03-17 01:56:21,558 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbcbfd541/07a0dc04720e40f583eb12b2fdd823a7/FLAG02ce5ad58 [2025-03-17 01:56:21,805 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:56:21,805 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-34.i [2025-03-17 01:56:21,813 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbcbfd541/07a0dc04720e40f583eb12b2fdd823a7/FLAG02ce5ad58 [2025-03-17 01:56:21,825 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbcbfd541/07a0dc04720e40f583eb12b2fdd823a7 [2025-03-17 01:56:21,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:56:21,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:56:21,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:56:21,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:56:21,832 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:56:21,832 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:56:21" (1/1) ... [2025-03-17 01:56:21,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be0aefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:56:21, skipping insertion in model container [2025-03-17 01:56:21,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:56:21" (1/1) ... [2025-03-17 01:56:21,850 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:56:21,960 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-ps-ci_file-34.i[919,932] [2025-03-17 01:56:22,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:56:22,046 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:56:22,056 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-ps-ci_file-34.i[919,932] [2025-03-17 01:56:22,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:56:22,107 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:56:22,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:56:22 WrapperNode [2025-03-17 01:56:22,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:56:22,109 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:56:22,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:56:22,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:56:22,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:56:22" (1/1) ... [2025-03-17 01:56:22,126 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:56:22" (1/1) ... [2025-03-17 01:56:22,157 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2025-03-17 01:56:22,157 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:56:22,157 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:56:22,157 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:56:22,157 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:56:22,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:56:22" (1/1) ... [2025-03-17 01:56:22,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:56:22" (1/1) ... [2025-03-17 01:56:22,171 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:56:22" (1/1) ... [2025-03-17 01:56:22,195 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-17 01:56:22,195 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:56:22" (1/1) ... [2025-03-17 01:56:22,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:56:22" (1/1) ... [2025-03-17 01:56:22,203 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:56:22" (1/1) ... [2025-03-17 01:56:22,208 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:56:22" (1/1) ... [2025-03-17 01:56:22,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:56:22" (1/1) ... [2025-03-17 01:56:22,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:56:22" (1/1) ... [2025-03-17 01:56:22,214 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:56:22,215 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:56:22,215 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:56:22,215 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:56:22,216 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:56:22" (1/1) ... [2025-03-17 01:56:22,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:56:22,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:56:22,239 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-17 01:56:22,241 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-17 01:56:22,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:56:22,257 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:56:22,257 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:56:22,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:56:22,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:56:22,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:56:22,323 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:56:22,325 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:56:22,731 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: havoc property_#t~bitwise18#1;havoc property_#t~ite20#1;havoc property_#t~bitwise19#1;havoc property_#t~short21#1; [2025-03-17 01:56:22,757 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-17 01:56:22,757 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:56:22,775 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:56:22,776 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:56:22,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:56:22 BoogieIcfgContainer [2025-03-17 01:56:22,776 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:56:22,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:56:22,778 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:56:22,781 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:56:22,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:56:21" (1/3) ... [2025-03-17 01:56:22,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70956d2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:56:22, skipping insertion in model container [2025-03-17 01:56:22,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:56:22" (2/3) ... [2025-03-17 01:56:22,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70956d2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:56:22, skipping insertion in model container [2025-03-17 01:56:22,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:56:22" (3/3) ... [2025-03-17 01:56:22,782 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-34.i [2025-03-17 01:56:22,792 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:56:22,794 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-34.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:56:22,826 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:56:22,836 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;@57582722, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:56:22,836 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:56:22,840 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 66 states have internal predecessors, (100), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 01:56:22,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 01:56:22,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:56:22,851 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:56:22,851 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:56:22,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:56:22,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1956776848, now seen corresponding path program 1 times [2025-03-17 01:56:22,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:56:22,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039528367] [2025-03-17 01:56:22,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:56:22,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:56:22,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 01:56:22,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 01:56:22,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:56:22,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:56:23,109 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 01:56:23,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:56:23,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039528367] [2025-03-17 01:56:23,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039528367] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:56:23,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338495021] [2025-03-17 01:56:23,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:56:23,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:56:23,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:56:23,116 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-17 01:56:23,117 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-17 01:56:23,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 01:56:23,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 01:56:23,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:56:23,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:56:23,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:56:23,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:56:23,270 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 01:56:23,270 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:56:23,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338495021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:56:23,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:56:23,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 01:56:23,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895882485] [2025-03-17 01:56:23,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:56:23,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:56:23,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:56:23,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:56:23,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:56:23,293 INFO L87 Difference]: Start difference. First operand has 88 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 66 states have internal predecessors, (100), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 01:56:23,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:56:23,320 INFO L93 Difference]: Finished difference Result 173 states and 298 transitions. [2025-03-17 01:56:23,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:56:23,322 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 138 [2025-03-17 01:56:23,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:56:23,326 INFO L225 Difference]: With dead ends: 173 [2025-03-17 01:56:23,327 INFO L226 Difference]: Without dead ends: 86 [2025-03-17 01:56:23,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 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-17 01:56:23,333 INFO L435 NwaCegarLoop]: 132 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, 132 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-03-17 01:56:23,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:56:23,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-17 01:56:23,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-17 01:56:23,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.5) internal successors, (96), 64 states have internal predecessors, (96), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 01:56:23,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 136 transitions. [2025-03-17 01:56:23,371 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 136 transitions. Word has length 138 [2025-03-17 01:56:23,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:56:23,371 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 136 transitions. [2025-03-17 01:56:23,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 01:56:23,372 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 136 transitions. [2025-03-17 01:56:23,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 01:56:23,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:56:23,374 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:56:23,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 01:56:23,574 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-17 01:56:23,575 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:56:23,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:56:23,575 INFO L85 PathProgramCache]: Analyzing trace with hash -580454382, now seen corresponding path program 1 times [2025-03-17 01:56:23,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:56:23,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019306424] [2025-03-17 01:56:23,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:56:23,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:56:23,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 01:56:23,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 01:56:23,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:56:23,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:56:23,991 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 01:56:23,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:56:23,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019306424] [2025-03-17 01:56:23,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019306424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:56:23,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:56:23,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:56:23,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143418138] [2025-03-17 01:56:23,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:56:23,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:56:23,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:56:23,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:56:23,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:56:23,993 INFO L87 Difference]: Start difference. First operand 86 states and 136 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 01:56:24,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:56:24,171 INFO L93 Difference]: Finished difference Result 286 states and 451 transitions. [2025-03-17 01:56:24,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:56:24,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2025-03-17 01:56:24,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:56:24,176 INFO L225 Difference]: With dead ends: 286 [2025-03-17 01:56:24,176 INFO L226 Difference]: Without dead ends: 201 [2025-03-17 01:56:24,177 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-17 01:56:24,177 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 162 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:56:24,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 416 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:56:24,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-17 01:56:24,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 171. [2025-03-17 01:56:24,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 128 states have (on average 1.4921875) internal successors, (191), 128 states have internal predecessors, (191), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 01:56:24,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 271 transitions. [2025-03-17 01:56:24,214 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 271 transitions. Word has length 138 [2025-03-17 01:56:24,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:56:24,214 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 271 transitions. [2025-03-17 01:56:24,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 01:56:24,215 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 271 transitions. [2025-03-17 01:56:24,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 01:56:24,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:56:24,216 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:56:24,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 01:56:24,216 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:56:24,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:56:24,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1377647735, now seen corresponding path program 1 times [2025-03-17 01:56:24,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:56:24,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362399294] [2025-03-17 01:56:24,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:56:24,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:56:24,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 01:56:24,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 01:56:24,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:56:24,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:56:24,463 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 01:56:24,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:56:24,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362399294] [2025-03-17 01:56:24,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362399294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:56:24,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:56:24,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:56:24,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413658833] [2025-03-17 01:56:24,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:56:24,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:56:24,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:56:24,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:56:24,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:56:24,466 INFO L87 Difference]: Start difference. First operand 171 states and 271 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 01:56:24,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:56:24,731 INFO L93 Difference]: Finished difference Result 506 states and 800 transitions. [2025-03-17 01:56:24,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:56:24,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2025-03-17 01:56:24,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:56:24,734 INFO L225 Difference]: With dead ends: 506 [2025-03-17 01:56:24,736 INFO L226 Difference]: Without dead ends: 336 [2025-03-17 01:56:24,737 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-03-17 01:56:24,739 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 174 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:56:24,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 509 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:56:24,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-17 01:56:24,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 175. [2025-03-17 01:56:24,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 132 states have (on average 1.4772727272727273) internal successors, (195), 132 states have internal predecessors, (195), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 01:56:24,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 275 transitions. [2025-03-17 01:56:24,769 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 275 transitions. Word has length 139 [2025-03-17 01:56:24,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:56:24,770 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 275 transitions. [2025-03-17 01:56:24,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 01:56:24,770 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 275 transitions. [2025-03-17 01:56:24,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 01:56:24,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:56:24,771 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:56:24,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 01:56:24,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:56:24,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:56:24,772 INFO L85 PathProgramCache]: Analyzing trace with hash 304727823, now seen corresponding path program 1 times [2025-03-17 01:56:24,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:56:24,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930661500] [2025-03-17 01:56:24,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:56:24,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:56:24,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 01:56:24,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 01:56:24,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:56:24,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:56:26,773 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 01:56:26,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:56:26,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930661500] [2025-03-17 01:56:26,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930661500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:56:26,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:56:26,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 01:56:26,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317666436] [2025-03-17 01:56:26,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:56:26,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 01:56:26,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:56:26,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 01:56:26,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 01:56:26,775 INFO L87 Difference]: Start difference. First operand 175 states and 275 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 01:56:27,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:56:27,235 INFO L93 Difference]: Finished difference Result 531 states and 823 transitions. [2025-03-17 01:56:27,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 01:56:27,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2025-03-17 01:56:27,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:56:27,239 INFO L225 Difference]: With dead ends: 531 [2025-03-17 01:56:27,239 INFO L226 Difference]: Without dead ends: 357 [2025-03-17 01:56:27,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 01:56:27,240 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 214 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:56:27,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 442 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 01:56:27,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-17 01:56:27,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 243. [2025-03-17 01:56:27,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 179 states have (on average 1.4692737430167597) internal successors, (263), 179 states have internal predecessors, (263), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 01:56:27,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 383 transitions. [2025-03-17 01:56:27,268 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 383 transitions. Word has length 140 [2025-03-17 01:56:27,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:56:27,268 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 383 transitions. [2025-03-17 01:56:27,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 01:56:27,268 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 383 transitions. [2025-03-17 01:56:27,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 01:56:27,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:56:27,270 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:56:27,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 01:56:27,270 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:56:27,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:56:27,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1244846870, now seen corresponding path program 1 times [2025-03-17 01:56:27,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:56:27,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83434958] [2025-03-17 01:56:27,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:56:27,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:56:27,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 01:56:27,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 01:56:27,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:56:27,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:56:52,628 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 01:56:52,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:56:52,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83434958] [2025-03-17 01:56:52,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83434958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:56:52,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:56:52,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 01:56:52,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517620654] [2025-03-17 01:56:52,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:56:52,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 01:56:52,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:56:52,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 01:56:52,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-03-17 01:56:52,632 INFO L87 Difference]: Start difference. First operand 243 states and 383 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 01:56:55,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:56:55,289 INFO L93 Difference]: Finished difference Result 678 states and 1026 transitions. [2025-03-17 01:56:55,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 01:56:55,290 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2025-03-17 01:56:55,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:56:55,292 INFO L225 Difference]: With dead ends: 678 [2025-03-17 01:56:55,292 INFO L226 Difference]: Without dead ends: 487 [2025-03-17 01:56:55,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2025-03-17 01:56:55,293 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 564 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:56:55,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 924 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 01:56:55,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-03-17 01:56:55,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 320. [2025-03-17 01:56:55,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 256 states have (on average 1.4609375) internal successors, (374), 256 states have internal predecessors, (374), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 01:56:55,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 494 transitions. [2025-03-17 01:56:55,321 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 494 transitions. Word has length 140 [2025-03-17 01:56:55,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:56:55,321 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 494 transitions. [2025-03-17 01:56:55,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 01:56:55,321 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 494 transitions. [2025-03-17 01:56:55,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 01:56:55,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:56:55,323 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:56:55,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 01:56:55,326 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:56:55,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:56:55,326 INFO L85 PathProgramCache]: Analyzing trace with hash -357343189, now seen corresponding path program 1 times [2025-03-17 01:56:55,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:56:55,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777861412] [2025-03-17 01:56:55,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:56:55,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:56:55,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 01:56:55,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 01:56:55,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:56:55,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:56:57,244 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 01:56:57,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:56:57,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777861412] [2025-03-17 01:56:57,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777861412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:56:57,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:56:57,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 01:56:57,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666586823] [2025-03-17 01:56:57,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:56:57,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 01:56:57,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:56:57,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 01:56:57,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 01:56:57,246 INFO L87 Difference]: Start difference. First operand 320 states and 494 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 01:56:58,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:56:58,421 INFO L93 Difference]: Finished difference Result 724 states and 1108 transitions. [2025-03-17 01:56:58,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 01:56:58,422 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2025-03-17 01:56:58,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:56:58,424 INFO L225 Difference]: With dead ends: 724 [2025-03-17 01:56:58,424 INFO L226 Difference]: Without dead ends: 534 [2025-03-17 01:56:58,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:56:58,425 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 374 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 01:56:58,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 525 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 01:56:58,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-17 01:56:58,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 368. [2025-03-17 01:56:58,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 304 states have (on average 1.444078947368421) internal successors, (439), 304 states have internal predecessors, (439), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 01:56:58,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 559 transitions. [2025-03-17 01:56:58,452 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 559 transitions. Word has length 140 [2025-03-17 01:56:58,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:56:58,452 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 559 transitions. [2025-03-17 01:56:58,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 01:56:58,452 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 559 transitions. [2025-03-17 01:56:58,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 01:56:58,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:56:58,455 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:56:58,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 01:56:58,455 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:56:58,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:56:58,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1242665963, now seen corresponding path program 1 times [2025-03-17 01:56:58,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:56:58,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81211902] [2025-03-17 01:56:58,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:56:58,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:56:58,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 01:56:58,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 01:56:58,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:56:58,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:57:00,938 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 01:57:00,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:57:00,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81211902] [2025-03-17 01:57:00,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81211902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:57:00,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:57:00,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 01:57:00,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704476649] [2025-03-17 01:57:00,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:57:00,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 01:57:00,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:57:00,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 01:57:00,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 01:57:00,940 INFO L87 Difference]: Start difference. First operand 368 states and 559 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 01:57:01,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:57:01,735 INFO L93 Difference]: Finished difference Result 700 states and 1055 transitions. [2025-03-17 01:57:01,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 01:57:01,737 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2025-03-17 01:57:01,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:57:01,740 INFO L225 Difference]: With dead ends: 700 [2025-03-17 01:57:01,740 INFO L226 Difference]: Without dead ends: 508 [2025-03-17 01:57:01,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:57:01,742 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 344 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 01:57:01,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 550 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 01:57:01,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-03-17 01:57:01,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 387. [2025-03-17 01:57:01,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 323 states have (on average 1.4520123839009287) internal successors, (469), 323 states have internal predecessors, (469), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 01:57:01,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 589 transitions. [2025-03-17 01:57:01,765 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 589 transitions. Word has length 140 [2025-03-17 01:57:01,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:57:01,765 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 589 transitions. [2025-03-17 01:57:01,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 01:57:01,765 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 589 transitions. [2025-03-17 01:57:01,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 01:57:01,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:57:01,767 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:57:01,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 01:57:01,767 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:57:01,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:57:01,768 INFO L85 PathProgramCache]: Analyzing trace with hash -200830802, now seen corresponding path program 1 times [2025-03-17 01:57:01,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:57:01,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551336447] [2025-03-17 01:57:01,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:57:01,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:57:01,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 01:57:01,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 01:57:01,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:57:01,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:57:01,956 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 01:57:01,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:57:01,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551336447] [2025-03-17 01:57:01,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551336447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:57:01,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:57:01,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:57:01,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229353254] [2025-03-17 01:57:01,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:57:01,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:57:01,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:57:01,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:57:01,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:57:01,958 INFO L87 Difference]: Start difference. First operand 387 states and 589 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 01:57:02,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:57:02,169 INFO L93 Difference]: Finished difference Result 621 states and 948 transitions. [2025-03-17 01:57:02,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:57:02,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2025-03-17 01:57:02,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:57:02,172 INFO L225 Difference]: With dead ends: 621 [2025-03-17 01:57:02,173 INFO L226 Difference]: Without dead ends: 387 [2025-03-17 01:57:02,174 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-17 01:57:02,175 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 114 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:57:02,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 329 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:57:02,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-17 01:57:02,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 359. [2025-03-17 01:57:02,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 295 states have (on average 1.416949152542373) internal successors, (418), 295 states have internal predecessors, (418), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 01:57:02,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 538 transitions. [2025-03-17 01:57:02,197 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 538 transitions. Word has length 140 [2025-03-17 01:57:02,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:57:02,197 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 538 transitions. [2025-03-17 01:57:02,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 01:57:02,197 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 538 transitions. [2025-03-17 01:57:02,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 01:57:02,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:57:02,198 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:57:02,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 01:57:02,199 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:57:02,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:57:02,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1755381047, now seen corresponding path program 1 times [2025-03-17 01:57:02,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:57:02,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047453080] [2025-03-17 01:57:02,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:57:02,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:57:02,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 01:57:02,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 01:57:02,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:57:02,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:57:07,820 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 01:57:07,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:57:07,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047453080] [2025-03-17 01:57:07,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047453080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:57:07,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:57:07,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 01:57:07,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428769705] [2025-03-17 01:57:07,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:57:07,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 01:57:07,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:57:07,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 01:57:07,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-17 01:57:07,822 INFO L87 Difference]: Start difference. First operand 359 states and 538 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 01:57:08,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:57:08,819 INFO L93 Difference]: Finished difference Result 533 states and 787 transitions. [2025-03-17 01:57:08,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 01:57:08,820 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2025-03-17 01:57:08,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:57:08,822 INFO L225 Difference]: With dead ends: 533 [2025-03-17 01:57:08,822 INFO L226 Difference]: Without dead ends: 446 [2025-03-17 01:57:08,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2025-03-17 01:57:08,823 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 301 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 01:57:08,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 779 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 01:57:08,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-03-17 01:57:08,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 353. [2025-03-17 01:57:08,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 289 states have (on average 1.4221453287197232) internal successors, (411), 289 states have internal predecessors, (411), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 01:57:08,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 531 transitions. [2025-03-17 01:57:08,848 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 531 transitions. Word has length 140 [2025-03-17 01:57:08,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:57:08,849 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 531 transitions. [2025-03-17 01:57:08,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 01:57:08,849 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 531 transitions. [2025-03-17 01:57:08,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 01:57:08,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:57:08,850 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:57:08,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 01:57:08,850 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:57:08,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:57:08,851 INFO L85 PathProgramCache]: Analyzing trace with hash 945117215, now seen corresponding path program 1 times [2025-03-17 01:57:08,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:57:08,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086824914] [2025-03-17 01:57:08,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:57:08,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:57:08,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 01:57:08,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 01:57:08,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:57:08,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:57:22,080 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 01:57:22,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:57:22,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086824914] [2025-03-17 01:57:22,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086824914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:57:22,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:57:22,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 01:57:22,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637246064] [2025-03-17 01:57:22,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:57:22,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 01:57:22,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:57:22,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 01:57:22,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:57:22,082 INFO L87 Difference]: Start difference. First operand 353 states and 531 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 01:57:24,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:57:24,038 INFO L93 Difference]: Finished difference Result 719 states and 1066 transitions. [2025-03-17 01:57:24,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 01:57:24,039 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2025-03-17 01:57:24,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:57:24,042 INFO L225 Difference]: With dead ends: 719 [2025-03-17 01:57:24,042 INFO L226 Difference]: Without dead ends: 545 [2025-03-17 01:57:24,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2025-03-17 01:57:24,043 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 472 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:57:24,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 859 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 01:57:24,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-17 01:57:24,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 381. [2025-03-17 01:57:24,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 317 states have (on average 1.4100946372239747) internal successors, (447), 317 states have internal predecessors, (447), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 01:57:24,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 567 transitions. [2025-03-17 01:57:24,070 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 567 transitions. Word has length 141 [2025-03-17 01:57:24,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:57:24,072 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 567 transitions. [2025-03-17 01:57:24,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 01:57:24,072 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 567 transitions. [2025-03-17 01:57:24,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 01:57:24,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:57:24,074 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:57:24,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 01:57:24,074 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:57:24,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:57:24,075 INFO L85 PathProgramCache]: Analyzing trace with hash -862337248, now seen corresponding path program 1 times [2025-03-17 01:57:24,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:57:24,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969572147] [2025-03-17 01:57:24,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:57:24,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:57:24,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 01:57:24,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 01:57:24,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:57:24,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:57:26,263 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 01:57:26,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:57:26,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969572147] [2025-03-17 01:57:26,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969572147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:57:26,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:57:26,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 01:57:26,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228429505] [2025-03-17 01:57:26,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:57:26,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 01:57:26,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:57:26,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 01:57:26,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-17 01:57:26,265 INFO L87 Difference]: Start difference. First operand 381 states and 567 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 01:57:28,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:57:28,583 INFO L93 Difference]: Finished difference Result 990 states and 1482 transitions. [2025-03-17 01:57:28,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 01:57:28,583 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2025-03-17 01:57:28,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:57:28,587 INFO L225 Difference]: With dead ends: 990 [2025-03-17 01:57:28,587 INFO L226 Difference]: Without dead ends: 816 [2025-03-17 01:57:28,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2025-03-17 01:57:28,588 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 317 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 01:57:28,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 1135 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 01:57:28,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2025-03-17 01:57:28,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 638. [2025-03-17 01:57:28,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 525 states have (on average 1.4152380952380952) internal successors, (743), 526 states have internal predecessors, (743), 105 states have call successors, (105), 7 states have call predecessors, (105), 7 states have return successors, (105), 104 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-17 01:57:28,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 953 transitions. [2025-03-17 01:57:28,625 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 953 transitions. Word has length 141 [2025-03-17 01:57:28,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:57:28,626 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 953 transitions. [2025-03-17 01:57:28,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 01:57:28,626 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 953 transitions. [2025-03-17 01:57:28,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 01:57:28,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:57:28,628 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:57:28,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 01:57:28,628 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:57:28,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:57:28,629 INFO L85 PathProgramCache]: Analyzing trace with hash 434583038, now seen corresponding path program 1 times [2025-03-17 01:57:28,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:57:28,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785550179] [2025-03-17 01:57:28,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:57:28,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:57:28,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 01:57:28,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 01:57:28,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:57:28,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:57:30,799 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 01:57:30,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:57:30,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785550179] [2025-03-17 01:57:30,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785550179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:57:30,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:57:30,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 01:57:30,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956362583] [2025-03-17 01:57:30,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:57:30,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 01:57:30,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:57:30,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 01:57:30,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-17 01:57:30,800 INFO L87 Difference]: Start difference. First operand 638 states and 953 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 01:57:32,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:57:32,755 INFO L93 Difference]: Finished difference Result 1649 states and 2450 transitions. [2025-03-17 01:57:32,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 01:57:32,756 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2025-03-17 01:57:32,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:57:32,761 INFO L225 Difference]: With dead ends: 1649 [2025-03-17 01:57:32,761 INFO L226 Difference]: Without dead ends: 1181 [2025-03-17 01:57:32,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=159, Invalid=347, Unknown=0, NotChecked=0, Total=506 [2025-03-17 01:57:32,763 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 416 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 01:57:32,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 561 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 01:57:32,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2025-03-17 01:57:32,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 807. [2025-03-17 01:57:32,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 694 states have (on average 1.4221902017291066) internal successors, (987), 695 states have internal predecessors, (987), 105 states have call successors, (105), 7 states have call predecessors, (105), 7 states have return successors, (105), 104 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-17 01:57:32,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1197 transitions. [2025-03-17 01:57:32,801 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1197 transitions. Word has length 141 [2025-03-17 01:57:32,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:57:32,802 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1197 transitions. [2025-03-17 01:57:32,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 01:57:32,802 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1197 transitions. [2025-03-17 01:57:32,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 01:57:32,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:57:32,803 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:57:32,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 01:57:32,804 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:57:32,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:57:32,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1372871425, now seen corresponding path program 1 times [2025-03-17 01:57:32,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:57:32,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715271805] [2025-03-17 01:57:32,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:57:32,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:57:32,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 01:57:32,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 01:57:32,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:57:32,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:57:45,481 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 01:57:45,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:57:45,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715271805] [2025-03-17 01:57:45,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715271805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:57:45,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:57:45,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 01:57:45,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117652450] [2025-03-17 01:57:45,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:57:45,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 01:57:45,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:57:45,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 01:57:45,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:57:45,483 INFO L87 Difference]: Start difference. First operand 807 states and 1197 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 01:57:46,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:57:46,993 INFO L93 Difference]: Finished difference Result 1216 states and 1806 transitions. [2025-03-17 01:57:46,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 01:57:46,993 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2025-03-17 01:57:46,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:57:46,997 INFO L225 Difference]: With dead ends: 1216 [2025-03-17 01:57:46,997 INFO L226 Difference]: Without dead ends: 918 [2025-03-17 01:57:46,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2025-03-17 01:57:46,999 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 299 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:57:46,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1133 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 01:57:47,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2025-03-17 01:57:47,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 807. [2025-03-17 01:57:47,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 694 states have (on average 1.4221902017291066) internal successors, (987), 695 states have internal predecessors, (987), 105 states have call successors, (105), 7 states have call predecessors, (105), 7 states have return successors, (105), 104 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-17 01:57:47,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1197 transitions. [2025-03-17 01:57:47,046 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1197 transitions. Word has length 141 [2025-03-17 01:57:47,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:57:47,046 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1197 transitions. [2025-03-17 01:57:47,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 01:57:47,047 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1197 transitions. [2025-03-17 01:57:47,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 01:57:47,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:57:47,048 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:57:47,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 01:57:47,048 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:57:47,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:57:47,049 INFO L85 PathProgramCache]: Analyzing trace with hash 475863429, now seen corresponding path program 1 times [2025-03-17 01:57:47,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:57:47,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382632613] [2025-03-17 01:57:47,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:57:47,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:57:47,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 01:57:47,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 01:57:47,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:57:47,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat