./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-99.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_fillercodesize_ps-cn-250_file-99.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 51679f677755cdcbe89cef639d9e0fff08a3a1c877b6770e3f1b1827d281f800 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:12:24,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:12:24,760 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:12:24,767 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:12:24,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:12:24,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:12:24,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:12:24,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:12:24,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:12:24,789 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:12:24,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:12:24,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:12:24,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:12:24,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:12:24,790 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:12:24,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:12:24,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:12:24,791 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:12:24,791 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:12:24,791 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:12:24,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:12:24,791 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:12:24,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:12:24,791 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:12:24,791 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:12:24,792 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:12:24,792 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:12:24,792 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:12:24,792 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:12:24,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:12:24,792 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:12:24,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:12:24,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:12:24,793 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:12:24,793 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:12:24,793 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:12:24,793 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:12:24,793 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:12:24,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:12:24,793 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:12:24,793 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:12:24,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:12:24,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:12:24,793 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 -> 51679f677755cdcbe89cef639d9e0fff08a3a1c877b6770e3f1b1827d281f800 [2025-03-17 00:12:25,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:12:25,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:12:25,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:12:25,029 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:12:25,030 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:12:25,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-99.i [2025-03-17 00:12:26,198 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cf1c1215/15246941efdf4fa28489abad6458a85d/FLAGff29359c5 [2025-03-17 00:12:26,456 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:12:26,457 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-99.i [2025-03-17 00:12:26,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cf1c1215/15246941efdf4fa28489abad6458a85d/FLAGff29359c5 [2025-03-17 00:12:26,758 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cf1c1215/15246941efdf4fa28489abad6458a85d [2025-03-17 00:12:26,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:12:26,761 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:12:26,762 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:12:26,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:12:26,765 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:12:26,765 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:12:26" (1/1) ... [2025-03-17 00:12:26,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6350a18e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:26, skipping insertion in model container [2025-03-17 00:12:26,766 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:12:26" (1/1) ... [2025-03-17 00:12:26,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:12:26,884 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_fillercodesize_ps-cn-250_file-99.i[916,929] [2025-03-17 00:12:26,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:12:26,984 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:12:26,991 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_fillercodesize_ps-cn-250_file-99.i[916,929] [2025-03-17 00:12:27,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:12:27,063 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:12:27,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:27 WrapperNode [2025-03-17 00:12:27,064 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:12:27,064 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:12:27,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:12:27,065 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:12:27,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:27" (1/1) ... [2025-03-17 00:12:27,080 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:27" (1/1) ... [2025-03-17 00:12:27,130 INFO L138 Inliner]: procedures = 26, calls = 93, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 586 [2025-03-17 00:12:27,134 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:12:27,134 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:12:27,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:12:27,137 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:12:27,144 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:27" (1/1) ... [2025-03-17 00:12:27,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:27" (1/1) ... [2025-03-17 00:12:27,154 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:27" (1/1) ... [2025-03-17 00:12:27,186 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 00:12:27,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:27" (1/1) ... [2025-03-17 00:12:27,188 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:27" (1/1) ... [2025-03-17 00:12:27,210 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:27" (1/1) ... [2025-03-17 00:12:27,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:27" (1/1) ... [2025-03-17 00:12:27,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:27" (1/1) ... [2025-03-17 00:12:27,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:27" (1/1) ... [2025-03-17 00:12:27,237 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:12:27,237 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:12:27,238 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:12:27,238 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:12:27,239 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:27" (1/1) ... [2025-03-17 00:12:27,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:12:27,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:12:27,270 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 00:12:27,275 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 00:12:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:12:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:12:27,293 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:12:27,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:12:27,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:12:27,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:12:27,399 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:12:27,401 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:12:28,056 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L441: havoc property_#t~bitwise60#1;havoc property_#t~short61#1; [2025-03-17 00:12:28,137 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-17 00:12:28,137 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:12:28,172 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:12:28,172 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:12:28,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:12:28 BoogieIcfgContainer [2025-03-17 00:12:28,172 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:12:28,174 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:12:28,174 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:12:28,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:12:28,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:12:26" (1/3) ... [2025-03-17 00:12:28,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a2cb9dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:12:28, skipping insertion in model container [2025-03-17 00:12:28,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:27" (2/3) ... [2025-03-17 00:12:28,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a2cb9dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:12:28, skipping insertion in model container [2025-03-17 00:12:28,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:12:28" (3/3) ... [2025-03-17 00:12:28,180 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-99.i [2025-03-17 00:12:28,190 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:12:28,192 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-99.i that has 2 procedures, 242 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:12:28,235 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:12:28,244 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;@6fd97f4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:12:28,244 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:12:28,249 INFO L276 IsEmpty]: Start isEmpty. Operand has 242 states, 159 states have (on average 1.5408805031446542) internal successors, (245), 160 states have internal predecessors, (245), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 00:12:28,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2025-03-17 00:12:28,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:12:28,265 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:12:28,265 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:12:28,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:12:28,269 INFO L85 PathProgramCache]: Analyzing trace with hash 277095912, now seen corresponding path program 1 times [2025-03-17 00:12:28,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:12:28,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238535630] [2025-03-17 00:12:28,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:12:28,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:12:28,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-03-17 00:12:28,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-03-17 00:12:28,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:12:28,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:12:28,968 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-17 00:12:28,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:12:28,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238535630] [2025-03-17 00:12:28,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238535630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:12:28,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:12:28,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:12:28,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252851769] [2025-03-17 00:12:28,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:12:28,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:12:28,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:12:28,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:12:28,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:12:28,998 INFO L87 Difference]: Start difference. First operand has 242 states, 159 states have (on average 1.5408805031446542) internal successors, (245), 160 states have internal predecessors, (245), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:12:29,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:12:29,198 INFO L93 Difference]: Finished difference Result 647 states and 1213 transitions. [2025-03-17 00:12:29,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:12:29,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 497 [2025-03-17 00:12:29,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:12:29,213 INFO L225 Difference]: With dead ends: 647 [2025-03-17 00:12:29,213 INFO L226 Difference]: Without dead ends: 406 [2025-03-17 00:12:29,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:12:29,222 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 268 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:12:29,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 860 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:12:29,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-03-17 00:12:29,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 403. [2025-03-17 00:12:29,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 277 states have (on average 1.5451263537906137) internal successors, (428), 278 states have internal predecessors, (428), 123 states have call successors, (123), 2 states have call predecessors, (123), 2 states have return successors, (123), 122 states have call predecessors, (123), 123 states have call successors, (123) [2025-03-17 00:12:29,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 674 transitions. [2025-03-17 00:12:29,339 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 674 transitions. Word has length 497 [2025-03-17 00:12:29,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:12:29,342 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 674 transitions. [2025-03-17 00:12:29,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:12:29,343 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 674 transitions. [2025-03-17 00:12:29,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2025-03-17 00:12:29,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:12:29,354 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:12:29,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 00:12:29,354 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:12:29,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:12:29,355 INFO L85 PathProgramCache]: Analyzing trace with hash -2067571129, now seen corresponding path program 1 times [2025-03-17 00:12:29,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:12:29,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473413055] [2025-03-17 00:12:29,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:12:29,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:12:29,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-03-17 00:12:29,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-03-17 00:12:29,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:12:29,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:12:29,726 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-17 00:12:29,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:12:29,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473413055] [2025-03-17 00:12:29,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473413055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:12:29,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:12:29,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:12:29,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694040377] [2025-03-17 00:12:29,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:12:29,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:12:29,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:12:29,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:12:29,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:12:29,733 INFO L87 Difference]: Start difference. First operand 403 states and 674 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:12:29,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:12:29,847 INFO L93 Difference]: Finished difference Result 1133 states and 1896 transitions. [2025-03-17 00:12:29,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:12:29,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 497 [2025-03-17 00:12:29,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:12:29,858 INFO L225 Difference]: With dead ends: 1133 [2025-03-17 00:12:29,858 INFO L226 Difference]: Without dead ends: 731 [2025-03-17 00:12:29,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:12:29,861 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 274 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:12:29,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 935 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:12:29,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2025-03-17 00:12:29,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 728. [2025-03-17 00:12:29,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 512 states have (on average 1.541015625) internal successors, (789), 515 states have internal predecessors, (789), 211 states have call successors, (211), 4 states have call predecessors, (211), 4 states have return successors, (211), 208 states have call predecessors, (211), 211 states have call successors, (211) [2025-03-17 00:12:29,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1211 transitions. [2025-03-17 00:12:29,945 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1211 transitions. Word has length 497 [2025-03-17 00:12:29,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:12:29,949 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 1211 transitions. [2025-03-17 00:12:29,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:12:29,949 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1211 transitions. [2025-03-17 00:12:29,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2025-03-17 00:12:29,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:12:29,957 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:12:29,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:12:29,957 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:12:29,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:12:29,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1972659622, now seen corresponding path program 1 times [2025-03-17 00:12:29,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:12:29,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454853832] [2025-03-17 00:12:29,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:12:29,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:12:29,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-03-17 00:12:30,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-03-17 00:12:30,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:12:30,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:12:30,517 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-17 00:12:30,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:12:30,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454853832] [2025-03-17 00:12:30,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454853832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:12:30,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:12:30,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:12:30,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979265604] [2025-03-17 00:12:30,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:12:30,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:12:30,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:12:30,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:12:30,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:12:30,521 INFO L87 Difference]: Start difference. First operand 728 states and 1211 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:12:31,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:12:31,361 INFO L93 Difference]: Finished difference Result 2780 states and 4617 transitions. [2025-03-17 00:12:31,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:12:31,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 497 [2025-03-17 00:12:31,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:12:31,378 INFO L225 Difference]: With dead ends: 2780 [2025-03-17 00:12:31,379 INFO L226 Difference]: Without dead ends: 2053 [2025-03-17 00:12:31,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-17 00:12:31,383 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 1094 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 564 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 564 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 00:12:31,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 1562 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [564 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 00:12:31,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2025-03-17 00:12:31,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 1419. [2025-03-17 00:12:31,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1419 states, 1001 states have (on average 1.5424575424575424) internal successors, (1544), 1008 states have internal predecessors, (1544), 409 states have call successors, (409), 8 states have call predecessors, (409), 8 states have return successors, (409), 402 states have call predecessors, (409), 409 states have call successors, (409) [2025-03-17 00:12:31,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2362 transitions. [2025-03-17 00:12:31,540 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2362 transitions. Word has length 497 [2025-03-17 00:12:31,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:12:31,542 INFO L471 AbstractCegarLoop]: Abstraction has 1419 states and 2362 transitions. [2025-03-17 00:12:31,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:12:31,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2362 transitions. [2025-03-17 00:12:31,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2025-03-17 00:12:31,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:12:31,550 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:12:31,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:12:31,550 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:12:31,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:12:31,551 INFO L85 PathProgramCache]: Analyzing trace with hash -421411761, now seen corresponding path program 1 times [2025-03-17 00:12:31,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:12:31,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536546690] [2025-03-17 00:12:31,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:12:31,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:12:31,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-17 00:12:31,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-17 00:12:31,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:12:31,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:12:32,226 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-17 00:12:32,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:12:32,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536546690] [2025-03-17 00:12:32,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536546690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:12:32,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:12:32,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:12:32,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358640050] [2025-03-17 00:12:32,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:12:32,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:12:32,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:12:32,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:12:32,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:12:32,229 INFO L87 Difference]: Start difference. First operand 1419 states and 2362 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:12:33,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:12:33,049 INFO L93 Difference]: Finished difference Result 3989 states and 6620 transitions. [2025-03-17 00:12:33,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:12:33,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 498 [2025-03-17 00:12:33,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:12:33,068 INFO L225 Difference]: With dead ends: 3989 [2025-03-17 00:12:33,069 INFO L226 Difference]: Without dead ends: 2571 [2025-03-17 00:12:33,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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 00:12:33,076 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 466 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 00:12:33,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 974 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 00:12:33,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2025-03-17 00:12:33,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2561. [2025-03-17 00:12:33,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2561 states, 1839 states have (on average 1.5399673735725938) internal successors, (2832), 1854 states have internal predecessors, (2832), 705 states have call successors, (705), 16 states have call predecessors, (705), 16 states have return successors, (705), 690 states have call predecessors, (705), 705 states have call successors, (705) [2025-03-17 00:12:33,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2561 states and 4242 transitions. [2025-03-17 00:12:33,291 INFO L78 Accepts]: Start accepts. Automaton has 2561 states and 4242 transitions. Word has length 498 [2025-03-17 00:12:33,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:12:33,293 INFO L471 AbstractCegarLoop]: Abstraction has 2561 states and 4242 transitions. [2025-03-17 00:12:33,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-17 00:12:33,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 4242 transitions. [2025-03-17 00:12:33,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-03-17 00:12:33,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:12:33,300 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:12:33,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:12:33,301 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:12:33,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:12:33,301 INFO L85 PathProgramCache]: Analyzing trace with hash -905934727, now seen corresponding path program 1 times [2025-03-17 00:12:33,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:12:33,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328059264] [2025-03-17 00:12:33,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:12:33,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:12:33,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-03-17 00:12:33,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-03-17 00:12:33,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:12:33,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:13:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 192 proven. 45 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-03-17 00:13:55,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:13:55,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328059264] [2025-03-17 00:13:55,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328059264] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:13:55,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738233758] [2025-03-17 00:13:55,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:13:55,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:13:55,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:13:55,246 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 00:13:55,246 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 00:13:55,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-03-17 00:13:55,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-03-17 00:13:55,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:13:55,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:13:55,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 1109 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 00:13:55,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:13:57,585 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 1373 proven. 447 refuted. 0 times theorem prover too weak. 10820 trivial. 0 not checked. [2025-03-17 00:13:57,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:13:59,202 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 21 proven. 450 refuted. 0 times theorem prover too weak. 12169 trivial. 0 not checked. [2025-03-17 00:13:59,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738233758] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:13:59,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:13:59,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 9, 9] total 40 [2025-03-17 00:13:59,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159715184] [2025-03-17 00:13:59,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:13:59,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-17 00:13:59,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:13:59,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-17 00:13:59,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1442, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 00:13:59,208 INFO L87 Difference]: Start difference. First operand 2561 states and 4242 transitions. Second operand has 40 states, 40 states have (on average 5.3) internal successors, (212), 39 states have internal predecessors, (212), 8 states have call successors, (236), 3 states have call predecessors, (236), 7 states have return successors, (237), 9 states have call predecessors, (237), 8 states have call successors, (237)