./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-64.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 93ddecb04a6299d03367d49b2a7c18daa1f10c6a17d17e5a40552766d0a5b65a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:18:09,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:18:09,104 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:18:09,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:18:09,107 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:18:09,123 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:18:09,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:18:09,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:18:09,124 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:18:09,124 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:18:09,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:18:09,125 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:18:09,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:18:09,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:18:09,125 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:18:09,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:18:09,126 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:18:09,126 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:18:09,126 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:18:09,126 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:18:09,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:18:09,126 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:18:09,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:18:09,126 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:18:09,126 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:18:09,126 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:18:09,126 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:18:09,126 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:18:09,126 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:18:09,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:18:09,126 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:18:09,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:18:09,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:18:09,126 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:18:09,126 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:18:09,126 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:18:09,127 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:18:09,127 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:18:09,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:18:09,127 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:18:09,127 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:18:09,128 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:18:09,128 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:18:09,128 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 -> 93ddecb04a6299d03367d49b2a7c18daa1f10c6a17d17e5a40552766d0a5b65a [2025-03-03 21:18:09,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:18:09,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:18:09,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:18:09,353 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:18:09,353 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:18:09,354 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-64.i [2025-03-03 21:18:10,525 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88404f107/d01f684e257a444091810f2fd1431421/FLAG6e6fdd6af [2025-03-03 21:18:10,779 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:18:10,780 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-64.i [2025-03-03 21:18:10,790 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88404f107/d01f684e257a444091810f2fd1431421/FLAG6e6fdd6af [2025-03-03 21:18:10,805 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88404f107/d01f684e257a444091810f2fd1431421 [2025-03-03 21:18:10,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:18:10,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:18:10,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:18:10,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:18:10,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:18:10,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:18:10" (1/1) ... [2025-03-03 21:18:10,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34237d50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:18:10, skipping insertion in model container [2025-03-03 21:18:10,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:18:10" (1/1) ... [2025-03-03 21:18:10,831 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:18:10,931 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-64.i[919,932] [2025-03-03 21:18:10,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:18:11,002 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:18:11,011 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-64.i[919,932] [2025-03-03 21:18:11,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:18:11,045 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:18:11,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:18:11 WrapperNode [2025-03-03 21:18:11,045 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:18:11,046 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:18:11,046 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:18:11,046 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:18:11,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:18:11" (1/1) ... [2025-03-03 21:18:11,057 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:18:11" (1/1) ... [2025-03-03 21:18:11,077 INFO L138 Inliner]: procedures = 26, calls = 59, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 271 [2025-03-03 21:18:11,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:18:11,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:18:11,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:18:11,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:18:11,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:18:11" (1/1) ... [2025-03-03 21:18:11,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:18:11" (1/1) ... [2025-03-03 21:18:11,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:18:11" (1/1) ... [2025-03-03 21:18:11,103 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 21:18:11,103 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:18:11" (1/1) ... [2025-03-03 21:18:11,103 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:18:11" (1/1) ... [2025-03-03 21:18:11,108 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:18:11" (1/1) ... [2025-03-03 21:18:11,108 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:18:11" (1/1) ... [2025-03-03 21:18:11,109 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:18:11" (1/1) ... [2025-03-03 21:18:11,110 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:18:11" (1/1) ... [2025-03-03 21:18:11,112 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:18:11,112 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:18:11,112 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:18:11,112 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:18:11,113 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:18:11" (1/1) ... [2025-03-03 21:18:11,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:18:11,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:18:11,141 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 21:18:11,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 21:18:11,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:18:11,159 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:18:11,159 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:18:11,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:18:11,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:18:11,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:18:11,231 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:18:11,232 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:18:11,545 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L213: havoc property_#t~bitwise29#1;havoc property_#t~short30#1; [2025-03-03 21:18:11,588 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 21:18:11,588 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:18:11,604 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:18:11,605 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:18:11,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:18:11 BoogieIcfgContainer [2025-03-03 21:18:11,605 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:18:11,607 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:18:11,607 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:18:11,611 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:18:11,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:18:10" (1/3) ... [2025-03-03 21:18:11,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eab4c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:18:11, skipping insertion in model container [2025-03-03 21:18:11,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:18:11" (2/3) ... [2025-03-03 21:18:11,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eab4c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:18:11, skipping insertion in model container [2025-03-03 21:18:11,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:18:11" (3/3) ... [2025-03-03 21:18:11,613 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-64.i [2025-03-03 21:18:11,623 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:18:11,625 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-64.i that has 2 procedures, 116 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:18:11,670 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:18:11,677 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;@3bbc30f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:18:11,677 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:18:11,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 68 states have internal predecessors, (91), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 21:18:11,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-03-03 21:18:11,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:18:11,695 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:18:11,696 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:18:11,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:18:11,700 INFO L85 PathProgramCache]: Analyzing trace with hash -737125538, now seen corresponding path program 1 times [2025-03-03 21:18:11,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:18:11,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464910773] [2025-03-03 21:18:11,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:18:11,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:18:11,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-03 21:18:11,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-03 21:18:11,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:18:11,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:18:12,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 4050 trivial. 0 not checked. [2025-03-03 21:18:12,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:18:12,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464910773] [2025-03-03 21:18:12,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464910773] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:18:12,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830000546] [2025-03-03 21:18:12,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:18:12,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:18:12,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:18:12,052 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:18:12,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 21:18:12,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-03 21:18:12,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-03 21:18:12,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:18:12,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:18:12,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:18:12,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:18:12,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 4050 trivial. 0 not checked. [2025-03-03 21:18:12,274 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:18:12,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830000546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:18:12,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:18:12,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:18:12,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851440112] [2025-03-03 21:18:12,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:18:12,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:18:12,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:18:12,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:18:12,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:18:12,297 INFO L87 Difference]: Start difference. First operand has 116 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 68 states have internal predecessors, (91), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 2 states have call successors, (46) [2025-03-03 21:18:12,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:18:12,323 INFO L93 Difference]: Finished difference Result 226 states and 407 transitions. [2025-03-03 21:18:12,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:18:12,325 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 2 states have call successors, (46) Word has length 282 [2025-03-03 21:18:12,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:18:12,329 INFO L225 Difference]: With dead ends: 226 [2025-03-03 21:18:12,330 INFO L226 Difference]: Without dead ends: 113 [2025-03-03 21:18:12,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:18:12,334 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:18:12,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:18:12,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-03 21:18:12,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-03 21:18:12,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 65 states have (on average 1.323076923076923) internal successors, (86), 65 states have internal predecessors, (86), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 21:18:12,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 178 transitions. [2025-03-03 21:18:12,373 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 178 transitions. Word has length 282 [2025-03-03 21:18:12,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:18:12,373 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 178 transitions. [2025-03-03 21:18:12,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 2 states have call successors, (46) [2025-03-03 21:18:12,373 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 178 transitions. [2025-03-03 21:18:12,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-03-03 21:18:12,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:18:12,376 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:18:12,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 21:18:12,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 21:18:12,577 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:18:12,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:18:12,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1772479392, now seen corresponding path program 1 times [2025-03-03 21:18:12,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:18:12,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225414372] [2025-03-03 21:18:12,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:18:12,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:18:12,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-03 21:18:12,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-03 21:18:12,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:18:12,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:18:13,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-03 21:18:13,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:18:13,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225414372] [2025-03-03 21:18:13,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225414372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:18:13,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:18:13,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:18:13,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545169855] [2025-03-03 21:18:13,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:18:13,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:18:13,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:18:13,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:18:13,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:18:13,208 INFO L87 Difference]: Start difference. First operand 113 states and 178 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-03 21:18:13,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:18:13,514 INFO L93 Difference]: Finished difference Result 342 states and 535 transitions. [2025-03-03 21:18:13,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:18:13,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 282 [2025-03-03 21:18:13,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:18:13,519 INFO L225 Difference]: With dead ends: 342 [2025-03-03 21:18:13,520 INFO L226 Difference]: Without dead ends: 232 [2025-03-03 21:18:13,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:18:13,523 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 185 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:18:13,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 825 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:18:13,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-03 21:18:13,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 120. [2025-03-03 21:18:13,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 21:18:13,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 188 transitions. [2025-03-03 21:18:13,549 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 188 transitions. Word has length 282 [2025-03-03 21:18:13,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:18:13,550 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 188 transitions. [2025-03-03 21:18:13,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-03 21:18:13,552 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 188 transitions. [2025-03-03 21:18:13,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-03-03 21:18:13,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:18:13,556 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:18:13,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:18:13,556 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:18:13,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:18:13,557 INFO L85 PathProgramCache]: Analyzing trace with hash -24471967, now seen corresponding path program 1 times [2025-03-03 21:18:13,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:18:13,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45801608] [2025-03-03 21:18:13,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:18:13,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:18:13,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-03 21:18:13,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-03 21:18:13,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:18:13,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:18:17,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-03 21:18:17,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:18:17,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45801608] [2025-03-03 21:18:17,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45801608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:18:17,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:18:17,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:18:17,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888072597] [2025-03-03 21:18:17,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:18:17,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:18:17,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:18:17,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:18:17,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:18:17,420 INFO L87 Difference]: Start difference. First operand 120 states and 188 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-03 21:18:17,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:18:17,746 INFO L93 Difference]: Finished difference Result 339 states and 526 transitions. [2025-03-03 21:18:17,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:18:17,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 282 [2025-03-03 21:18:17,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:18:17,751 INFO L225 Difference]: With dead ends: 339 [2025-03-03 21:18:17,751 INFO L226 Difference]: Without dead ends: 222 [2025-03-03 21:18:17,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:18:17,752 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 157 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:18:17,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 933 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:18:17,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-03 21:18:17,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 120. [2025-03-03 21:18:17,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 21:18:17,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 188 transitions. [2025-03-03 21:18:17,764 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 188 transitions. Word has length 282 [2025-03-03 21:18:17,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:18:17,765 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 188 transitions. [2025-03-03 21:18:17,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-03 21:18:17,765 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 188 transitions. [2025-03-03 21:18:17,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-03-03 21:18:17,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:18:17,767 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:18:17,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:18:17,768 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:18:17,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:18:17,768 INFO L85 PathProgramCache]: Analyzing trace with hash 805675330, now seen corresponding path program 1 times [2025-03-03 21:18:17,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:18:17,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973144766] [2025-03-03 21:18:17,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:18:17,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:18:17,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-03 21:18:17,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-03 21:18:17,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:18:17,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:18:17,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-03 21:18:17,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:18:17,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973144766] [2025-03-03 21:18:17,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973144766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:18:17,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:18:17,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:18:17,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316249964] [2025-03-03 21:18:17,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:18:17,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:18:17,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:18:17,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:18:17,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:18:17,991 INFO L87 Difference]: Start difference. First operand 120 states and 188 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-03 21:18:18,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:18:18,184 INFO L93 Difference]: Finished difference Result 424 states and 664 transitions. [2025-03-03 21:18:18,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:18:18,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 282 [2025-03-03 21:18:18,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:18:18,187 INFO L225 Difference]: With dead ends: 424 [2025-03-03 21:18:18,187 INFO L226 Difference]: Without dead ends: 307 [2025-03-03 21:18:18,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:18:18,188 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 307 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:18:18,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 812 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:18:18,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-03 21:18:18,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 120. [2025-03-03 21:18:18,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 21:18:18,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 188 transitions. [2025-03-03 21:18:18,205 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 188 transitions. Word has length 282 [2025-03-03 21:18:18,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:18:18,206 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 188 transitions. [2025-03-03 21:18:18,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-03 21:18:18,207 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 188 transitions. [2025-03-03 21:18:18,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-03-03 21:18:18,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:18:18,210 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:18:18,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:18:18,210 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:18:18,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:18:18,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1692340607, now seen corresponding path program 1 times [2025-03-03 21:18:18,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:18:18,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161341548] [2025-03-03 21:18:18,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:18:18,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:18:18,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-03 21:18:18,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-03 21:18:18,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:18:18,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:18:18,413 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-03 21:18:18,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:18:18,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161341548] [2025-03-03 21:18:18,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161341548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:18:18,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:18:18,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:18:18,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917596665] [2025-03-03 21:18:18,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:18:18,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:18:18,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:18:18,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:18:18,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:18:18,415 INFO L87 Difference]: Start difference. First operand 120 states and 188 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-03 21:18:18,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:18:18,602 INFO L93 Difference]: Finished difference Result 424 states and 663 transitions. [2025-03-03 21:18:18,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:18:18,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 282 [2025-03-03 21:18:18,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:18:18,606 INFO L225 Difference]: With dead ends: 424 [2025-03-03 21:18:18,607 INFO L226 Difference]: Without dead ends: 307 [2025-03-03 21:18:18,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:18:18,608 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 296 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:18:18,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 841 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:18:18,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-03 21:18:18,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 113. [2025-03-03 21:18:18,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 65 states have internal predecessors, (85), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 21:18:18,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 177 transitions. [2025-03-03 21:18:18,627 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 177 transitions. Word has length 282 [2025-03-03 21:18:18,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:18:18,628 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 177 transitions. [2025-03-03 21:18:18,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-03 21:18:18,628 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 177 transitions. [2025-03-03 21:18:18,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-03-03 21:18:18,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:18:18,630 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:18:18,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:18:18,630 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:18:18,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:18:18,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1719247262, now seen corresponding path program 1 times [2025-03-03 21:18:18,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:18:18,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044040250] [2025-03-03 21:18:18,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:18:18,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:18:18,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-03-03 21:18:18,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-03-03 21:18:18,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:18:18,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat