./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_operatoramount_amount500_file-2.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 0f4d1a0f878f07f9b07af3368e16f27fe17adbf3f533e01dbd51821a170a1e65 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:41:45,192 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:41:45,244 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:41:45,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:41:45,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:41:45,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:41:45,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:41:45,274 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:41:45,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:41:45,275 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:41:45,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:41:45,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:41:45,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:41:45,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:41:45,276 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:41:45,277 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:41:45,277 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:41:45,277 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:41:45,277 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:41:45,277 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:41:45,277 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:41:45,277 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:41:45,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:41:45,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:41:45,277 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:41:45,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:41:45,278 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:41:45,278 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:41:45,278 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:41:45,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:41:45,278 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:41:45,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:41:45,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:41:45,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:41:45,278 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:41:45,278 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:41:45,278 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:41:45,278 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:41:45,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:41:45,279 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:41:45,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:41:45,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:41:45,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:41:45,279 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 -> 0f4d1a0f878f07f9b07af3368e16f27fe17adbf3f533e01dbd51821a170a1e65 [2025-03-08 15:41:45,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:41:45,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:41:45,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:41:45,541 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:41:45,542 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:41:45,542 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-2.i [2025-03-08 15:41:46,737 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9e106425/b774a902ccfa4ba8b5d9c400bdec5f8d/FLAG2dcfa4595 [2025-03-08 15:41:47,019 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:41:47,020 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-2.i [2025-03-08 15:41:47,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9e106425/b774a902ccfa4ba8b5d9c400bdec5f8d/FLAG2dcfa4595 [2025-03-08 15:41:47,302 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9e106425/b774a902ccfa4ba8b5d9c400bdec5f8d [2025-03-08 15:41:47,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:41:47,304 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:41:47,305 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:41:47,305 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:41:47,308 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:41:47,309 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:41:47" (1/1) ... [2025-03-08 15:41:47,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d912b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:47, skipping insertion in model container [2025-03-08 15:41:47,310 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:41:47" (1/1) ... [2025-03-08 15:41:47,335 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:41:47,438 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_operatoramount_amount500_file-2.i[915,928] [2025-03-08 15:41:47,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:41:47,660 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:41:47,670 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_operatoramount_amount500_file-2.i[915,928] [2025-03-08 15:41:47,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:41:47,801 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:41:47,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:47 WrapperNode [2025-03-08 15:41:47,802 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:41:47,803 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:41:47,803 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:41:47,803 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:41:47,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:47" (1/1) ... [2025-03-08 15:41:47,821 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:47" (1/1) ... [2025-03-08 15:41:47,889 INFO L138 Inliner]: procedures = 26, calls = 86, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 702 [2025-03-08 15:41:47,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:41:47,890 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:41:47,890 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:41:47,890 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:41:47,900 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:47" (1/1) ... [2025-03-08 15:41:47,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:47" (1/1) ... [2025-03-08 15:41:47,925 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:47" (1/1) ... [2025-03-08 15:41:47,997 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-08 15:41:47,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:47" (1/1) ... [2025-03-08 15:41:47,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:47" (1/1) ... [2025-03-08 15:41:48,021 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:47" (1/1) ... [2025-03-08 15:41:48,029 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:47" (1/1) ... [2025-03-08 15:41:48,042 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:47" (1/1) ... [2025-03-08 15:41:48,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:47" (1/1) ... [2025-03-08 15:41:48,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:41:48,060 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:41:48,060 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:41:48,060 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:41:48,061 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:47" (1/1) ... [2025-03-08 15:41:48,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:41:48,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:41:48,090 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-08 15:41:48,092 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-08 15:41:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:41:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:41:48,113 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:41:48,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:41:48,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:41:48,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:41:48,232 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:41:48,234 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:41:49,088 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L641: havoc property_#t~ite52#1;havoc property_#t~ite51#1;havoc property_#t~bitwise50#1;havoc property_#t~short53#1;havoc property_#t~bitwise54#1;havoc property_#t~short55#1;havoc property_#t~ite58#1;havoc property_#t~ite57#1;havoc property_#t~bitwise56#1;havoc property_#t~short59#1;havoc property_#t~ite61#1;havoc property_#t~bitwise60#1;havoc property_#t~short62#1; [2025-03-08 15:41:49,237 INFO L? ?]: Removed 82 outVars from TransFormulas that were not future-live. [2025-03-08 15:41:49,237 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:41:49,265 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:41:49,267 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-08 15:41:49,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:41:49 BoogieIcfgContainer [2025-03-08 15:41:49,267 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:41:49,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:41:49,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:41:49,273 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:41:49,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:41:47" (1/3) ... [2025-03-08 15:41:49,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f1ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:41:49, skipping insertion in model container [2025-03-08 15:41:49,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:47" (2/3) ... [2025-03-08 15:41:49,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f1ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:41:49, skipping insertion in model container [2025-03-08 15:41:49,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:41:49" (3/3) ... [2025-03-08 15:41:49,276 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-2.i [2025-03-08 15:41:49,286 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:41:49,288 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-2.i that has 2 procedures, 279 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:41:49,335 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:41:49,345 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;@7e5fd5fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:41:49,347 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:41:49,351 INFO L276 IsEmpty]: Start isEmpty. Operand has 279 states, 203 states have (on average 1.5369458128078817) internal successors, (312), 204 states have internal predecessors, (312), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-08 15:41:49,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-08 15:41:49,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:49,378 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:41:49,378 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:49,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:49,382 INFO L85 PathProgramCache]: Analyzing trace with hash 875070065, now seen corresponding path program 1 times [2025-03-08 15:41:49,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:49,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975957270] [2025-03-08 15:41:49,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:49,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:49,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-08 15:41:49,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-08 15:41:49,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:49,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:50,004 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2025-03-08 15:41:50,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:50,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975957270] [2025-03-08 15:41:50,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975957270] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:41:50,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412374537] [2025-03-08 15:41:50,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:50,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:41:50,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:41:50,011 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-08 15:41:50,013 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-08 15:41:50,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-08 15:41:50,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-08 15:41:50,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:50,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:50,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 1215 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:41:50,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:41:50,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2025-03-08 15:41:50,434 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:41:50,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412374537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:50,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:41:50,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:41:50,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426159770] [2025-03-08 15:41:50,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:50,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:41:50,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:50,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:41:50,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:41:50,460 INFO L87 Difference]: Start difference. First operand has 279 states, 203 states have (on average 1.5369458128078817) internal successors, (312), 204 states have internal predecessors, (312), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) Second operand has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-08 15:41:50,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:50,532 INFO L93 Difference]: Finished difference Result 552 states and 984 transitions. [2025-03-08 15:41:50,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:41:50,540 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) Word has length 494 [2025-03-08 15:41:50,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:50,549 INFO L225 Difference]: With dead ends: 552 [2025-03-08 15:41:50,549 INFO L226 Difference]: Without dead ends: 276 [2025-03-08 15:41:50,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 495 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-08 15:41:50,559 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:50,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 445 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:41:50,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-08 15:41:50,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2025-03-08 15:41:50,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 201 states have (on average 1.527363184079602) internal successors, (307), 201 states have internal predecessors, (307), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-08 15:41:50,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 453 transitions. [2025-03-08 15:41:50,634 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 453 transitions. Word has length 494 [2025-03-08 15:41:50,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:50,634 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 453 transitions. [2025-03-08 15:41:50,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-08 15:41:50,635 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 453 transitions. [2025-03-08 15:41:50,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-08 15:41:50,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:50,642 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:41:50,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 15:41:50,848 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-08 15:41:50,848 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:50,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:50,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1756629042, now seen corresponding path program 1 times [2025-03-08 15:41:50,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:50,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060424412] [2025-03-08 15:41:50,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:50,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:50,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-08 15:41:51,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-08 15:41:51,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:51,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:52,784 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 15:41:52,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:52,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060424412] [2025-03-08 15:41:52,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060424412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:52,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:52,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:41:52,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857797742] [2025-03-08 15:41:52,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:52,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:41:52,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:52,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:41:52,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:41:52,789 INFO L87 Difference]: Start difference. First operand 276 states and 453 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:41:53,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:53,025 INFO L93 Difference]: Finished difference Result 717 states and 1172 transitions. [2025-03-08 15:41:53,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:41:53,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 494 [2025-03-08 15:41:53,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:53,036 INFO L225 Difference]: With dead ends: 717 [2025-03-08 15:41:53,036 INFO L226 Difference]: Without dead ends: 444 [2025-03-08 15:41:53,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:41:53,037 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 737 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:53,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 865 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:41:53,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-08 15:41:53,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 334. [2025-03-08 15:41:53,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 258 states have (on average 1.562015503875969) internal successors, (403), 258 states have internal predecessors, (403), 73 states have call successors, (73), 2 states have call predecessors, (73), 2 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-08 15:41:53,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 549 transitions. [2025-03-08 15:41:53,070 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 549 transitions. Word has length 494 [2025-03-08 15:41:53,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:53,073 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 549 transitions. [2025-03-08 15:41:53,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:41:53,073 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 549 transitions. [2025-03-08 15:41:53,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-08 15:41:53,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:53,080 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:41:53,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:41:53,080 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:53,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:53,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1965327345, now seen corresponding path program 1 times [2025-03-08 15:41:53,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:53,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105969269] [2025-03-08 15:41:53,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:53,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:53,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-08 15:41:53,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-08 15:41:53,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:53,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:54,582 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 15:41:54,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:54,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105969269] [2025-03-08 15:41:54,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105969269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:54,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:54,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:41:54,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046037362] [2025-03-08 15:41:54,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:54,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:41:54,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:54,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:41:54,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:41:54,586 INFO L87 Difference]: Start difference. First operand 334 states and 549 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:41:54,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:54,914 INFO L93 Difference]: Finished difference Result 898 states and 1449 transitions. [2025-03-08 15:41:54,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:41:54,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 494 [2025-03-08 15:41:54,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:54,919 INFO L225 Difference]: With dead ends: 898 [2025-03-08 15:41:54,919 INFO L226 Difference]: Without dead ends: 567 [2025-03-08 15:41:54,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:41:54,921 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 300 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:54,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1369 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:41:54,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-03-08 15:41:54,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 491. [2025-03-08 15:41:54,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 393 states have (on average 1.5572519083969465) internal successors, (612), 394 states have internal predecessors, (612), 93 states have call successors, (93), 4 states have call predecessors, (93), 4 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 15:41:54,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 798 transitions. [2025-03-08 15:41:54,954 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 798 transitions. Word has length 494 [2025-03-08 15:41:54,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:54,955 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 798 transitions. [2025-03-08 15:41:54,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:41:54,956 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 798 transitions. [2025-03-08 15:41:54,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-08 15:41:54,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:54,961 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:41:54,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:41:54,961 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:54,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:54,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1368025934, now seen corresponding path program 1 times [2025-03-08 15:41:54,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:54,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215998765] [2025-03-08 15:41:54,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:54,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:54,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-08 15:41:55,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-08 15:41:55,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:55,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:55,485 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 15:41:55,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:55,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215998765] [2025-03-08 15:41:55,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215998765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:55,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:55,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:41:55,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444846472] [2025-03-08 15:41:55,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:55,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:41:55,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:55,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:41:55,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:41:55,488 INFO L87 Difference]: Start difference. First operand 491 states and 798 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:41:56,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:56,054 INFO L93 Difference]: Finished difference Result 1851 states and 3003 transitions. [2025-03-08 15:41:56,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:41:56,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 494 [2025-03-08 15:41:56,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:56,064 INFO L225 Difference]: With dead ends: 1851 [2025-03-08 15:41:56,065 INFO L226 Difference]: Without dead ends: 1363 [2025-03-08 15:41:56,069 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-08 15:41:56,071 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 680 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:56,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 2051 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:41:56,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2025-03-08 15:41:56,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1359. [2025-03-08 15:41:56,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 1067 states have (on average 1.5332708528584817) internal successors, (1636), 1070 states have internal predecessors, (1636), 279 states have call successors, (279), 12 states have call predecessors, (279), 12 states have return successors, (279), 276 states have call predecessors, (279), 279 states have call successors, (279) [2025-03-08 15:41:56,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 2194 transitions. [2025-03-08 15:41:56,207 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 2194 transitions. Word has length 494 [2025-03-08 15:41:56,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:56,208 INFO L471 AbstractCegarLoop]: Abstraction has 1359 states and 2194 transitions. [2025-03-08 15:41:56,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:41:56,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 2194 transitions. [2025-03-08 15:41:56,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-08 15:41:56,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:56,214 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:41:56,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:41:56,214 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:56,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:56,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1274873326, now seen corresponding path program 1 times [2025-03-08 15:41:56,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:56,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223347784] [2025-03-08 15:41:56,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:56,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:56,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-08 15:41:56,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-08 15:41:56,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:56,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:57,046 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 15:41:57,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:57,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223347784] [2025-03-08 15:41:57,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223347784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:57,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:57,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:41:57,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3292115] [2025-03-08 15:41:57,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:57,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:41:57,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:57,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:41:57,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:41:57,048 INFO L87 Difference]: Start difference. First operand 1359 states and 2194 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:41:57,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:57,424 INFO L93 Difference]: Finished difference Result 4428 states and 7115 transitions. [2025-03-08 15:41:57,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:41:57,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 494 [2025-03-08 15:41:57,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:57,440 INFO L225 Difference]: With dead ends: 4428 [2025-03-08 15:41:57,440 INFO L226 Difference]: Without dead ends: 3072 [2025-03-08 15:41:57,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:41:57,446 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 485 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:57,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 1512 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:41:57,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2025-03-08 15:41:57,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2689. [2025-03-08 15:41:57,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2689 states, 2259 states have (on average 1.5657370517928286) internal successors, (3537), 2268 states have internal predecessors, (3537), 405 states have call successors, (405), 24 states have call predecessors, (405), 24 states have return successors, (405), 396 states have call predecessors, (405), 405 states have call successors, (405) [2025-03-08 15:41:57,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2689 states and 4347 transitions. [2025-03-08 15:41:57,604 INFO L78 Accepts]: Start accepts. Automaton has 2689 states and 4347 transitions. Word has length 494 [2025-03-08 15:41:57,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:57,607 INFO L471 AbstractCegarLoop]: Abstraction has 2689 states and 4347 transitions. [2025-03-08 15:41:57,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:41:57,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2689 states and 4347 transitions. [2025-03-08 15:41:57,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-08 15:41:57,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:57,614 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:41:57,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:41:57,615 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:57,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:57,617 INFO L85 PathProgramCache]: Analyzing trace with hash -50167563, now seen corresponding path program 1 times [2025-03-08 15:41:57,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:57,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796440722] [2025-03-08 15:41:57,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:57,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:57,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-08 15:41:57,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-08 15:41:57,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:57,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:00,038 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 15:42:00,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:42:00,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796440722] [2025-03-08 15:42:00,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796440722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:42:00,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:42:00,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 15:42:00,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4864723] [2025-03-08 15:42:00,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:42:00,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 15:42:00,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:42:00,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 15:42:00,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:42:00,042 INFO L87 Difference]: Start difference. First operand 2689 states and 4347 transitions. Second operand has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-08 15:42:04,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:42:04,520 INFO L93 Difference]: Finished difference Result 32588 states and 53088 transitions. [2025-03-08 15:42:04,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-08 15:42:04,521 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) Word has length 494 [2025-03-08 15:42:04,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:42:04,633 INFO L225 Difference]: With dead ends: 32588 [2025-03-08 15:42:04,633 INFO L226 Difference]: Without dead ends: 29902 [2025-03-08 15:42:04,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=252, Invalid=740, Unknown=0, NotChecked=0, Total=992 [2025-03-08 15:42:04,648 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 5120 mSDsluCounter, 3998 mSDsCounter, 0 mSdLazyCounter, 2454 mSolverCounterSat, 596 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5120 SdHoareTripleChecker+Valid, 4855 SdHoareTripleChecker+Invalid, 3050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 596 IncrementalHoareTripleChecker+Valid, 2454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:42:04,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5120 Valid, 4855 Invalid, 3050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [596 Valid, 2454 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-08 15:42:04,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29902 states. [2025-03-08 15:42:05,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29902 to 17383. [2025-03-08 15:42:05,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17383 states, 15792 states have (on average 1.5938449848024316) internal successors, (25170), 15870 states have internal predecessors, (25170), 1446 states have call successors, (1446), 144 states have call predecessors, (1446), 144 states have return successors, (1446), 1368 states have call predecessors, (1446), 1446 states have call successors, (1446) [2025-03-08 15:42:05,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17383 states to 17383 states and 28062 transitions. [2025-03-08 15:42:05,528 INFO L78 Accepts]: Start accepts. Automaton has 17383 states and 28062 transitions. Word has length 494 [2025-03-08 15:42:05,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:42:05,529 INFO L471 AbstractCegarLoop]: Abstraction has 17383 states and 28062 transitions. [2025-03-08 15:42:05,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-08 15:42:05,534 INFO L276 IsEmpty]: Start isEmpty. Operand 17383 states and 28062 transitions. [2025-03-08 15:42:05,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-08 15:42:05,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:05,551 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:42:05,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:42:05,552 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:05,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:05,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1457384246, now seen corresponding path program 1 times [2025-03-08 15:42:05,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:05,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549215066] [2025-03-08 15:42:05,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:05,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:05,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-08 15:42:05,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-08 15:42:05,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:05,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:06,088 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 15:42:06,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:42:06,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549215066] [2025-03-08 15:42:06,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549215066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:42:06,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:42:06,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:42:06,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000725532] [2025-03-08 15:42:06,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:42:06,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:42:06,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:42:06,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:42:06,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:42:06,090 INFO L87 Difference]: Start difference. First operand 17383 states and 28062 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:42:08,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:42:08,080 INFO L93 Difference]: Finished difference Result 76525 states and 122697 transitions. [2025-03-08 15:42:08,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:42:08,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 494 [2025-03-08 15:42:08,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:42:08,263 INFO L225 Difference]: With dead ends: 76525 [2025-03-08 15:42:08,264 INFO L226 Difference]: Without dead ends: 59117 [2025-03-08 15:42:08,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-08 15:42:08,309 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 941 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:42:08,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 1627 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:42:08,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59117 states. [2025-03-08 15:42:09,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59117 to 25851. [2025-03-08 15:42:09,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25851 states, 24260 states have (on average 1.6002885408079142) internal successors, (38823), 24338 states have internal predecessors, (38823), 1446 states have call successors, (1446), 144 states have call predecessors, (1446), 144 states have return successors, (1446), 1368 states have call predecessors, (1446), 1446 states have call successors, (1446) [2025-03-08 15:42:09,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25851 states to 25851 states and 41715 transitions. [2025-03-08 15:42:09,340 INFO L78 Accepts]: Start accepts. Automaton has 25851 states and 41715 transitions. Word has length 494 [2025-03-08 15:42:09,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:42:09,341 INFO L471 AbstractCegarLoop]: Abstraction has 25851 states and 41715 transitions. [2025-03-08 15:42:09,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:42:09,341 INFO L276 IsEmpty]: Start isEmpty. Operand 25851 states and 41715 transitions. [2025-03-08 15:42:09,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-08 15:42:09,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:09,371 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:42:09,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:42:09,371 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:09,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:09,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1008687607, now seen corresponding path program 1 times [2025-03-08 15:42:09,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:09,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522162587] [2025-03-08 15:42:09,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:09,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:09,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-08 15:42:09,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-08 15:42:09,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:09,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:10,205 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 15:42:10,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:42:10,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522162587] [2025-03-08 15:42:10,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522162587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:42:10,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:42:10,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:42:10,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332558926] [2025-03-08 15:42:10,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:42:10,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:42:10,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:42:10,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:42:10,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:42:10,208 INFO L87 Difference]: Start difference. First operand 25851 states and 41715 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:42:12,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:42:12,018 INFO L93 Difference]: Finished difference Result 75647 states and 120951 transitions. [2025-03-08 15:42:12,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:42:12,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 494 [2025-03-08 15:42:12,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:42:12,127 INFO L225 Difference]: With dead ends: 75647 [2025-03-08 15:42:12,127 INFO L226 Difference]: Without dead ends: 49799 [2025-03-08 15:42:12,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:42:12,311 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 658 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:42:12,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1504 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:42:12,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49799 states. [2025-03-08 15:42:13,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49799 to 26355. [2025-03-08 15:42:13,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26355 states, 24764 states have (on average 1.599095461153287) internal successors, (39600), 24842 states have internal predecessors, (39600), 1446 states have call successors, (1446), 144 states have call predecessors, (1446), 144 states have return successors, (1446), 1368 states have call predecessors, (1446), 1446 states have call successors, (1446) [2025-03-08 15:42:13,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26355 states to 26355 states and 42492 transitions. [2025-03-08 15:42:13,540 INFO L78 Accepts]: Start accepts. Automaton has 26355 states and 42492 transitions. Word has length 494 [2025-03-08 15:42:13,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:42:13,542 INFO L471 AbstractCegarLoop]: Abstraction has 26355 states and 42492 transitions. [2025-03-08 15:42:13,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:42:13,542 INFO L276 IsEmpty]: Start isEmpty. Operand 26355 states and 42492 transitions. [2025-03-08 15:42:13,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-08 15:42:13,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:13,566 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:42:13,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:42:13,567 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:13,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:13,567 INFO L85 PathProgramCache]: Analyzing trace with hash 102937430, now seen corresponding path program 1 times [2025-03-08 15:42:13,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:13,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43886114] [2025-03-08 15:42:13,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:13,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:13,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-08 15:42:13,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-08 15:42:13,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:13,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:14,202 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 15:42:14,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:42:14,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43886114] [2025-03-08 15:42:14,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43886114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:42:14,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:42:14,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:42:14,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253748455] [2025-03-08 15:42:14,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:42:14,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:42:14,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:42:14,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:42:14,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:42:14,205 INFO L87 Difference]: Start difference. First operand 26355 states and 42492 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:42:15,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:42:15,641 INFO L93 Difference]: Finished difference Result 78321 states and 126258 transitions. [2025-03-08 15:42:15,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:42:15,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 494 [2025-03-08 15:42:15,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:42:15,739 INFO L225 Difference]: With dead ends: 78321 [2025-03-08 15:42:15,739 INFO L226 Difference]: Without dead ends: 51969 [2025-03-08 15:42:15,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:42:15,769 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 283 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:42:15,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 1183 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:42:15,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51969 states. [2025-03-08 15:42:17,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51969 to 51961. [2025-03-08 15:42:17,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51961 states, 48984 states have (on average 1.5961538461538463) internal successors, (78186), 49146 states have internal predecessors, (78186), 2688 states have call successors, (2688), 288 states have call predecessors, (2688), 288 states have return successors, (2688), 2526 states have call predecessors, (2688), 2688 states have call successors, (2688) [2025-03-08 15:42:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51961 states to 51961 states and 83562 transitions. [2025-03-08 15:42:17,260 INFO L78 Accepts]: Start accepts. Automaton has 51961 states and 83562 transitions. Word has length 494 [2025-03-08 15:42:17,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:42:17,262 INFO L471 AbstractCegarLoop]: Abstraction has 51961 states and 83562 transitions. [2025-03-08 15:42:17,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:42:17,262 INFO L276 IsEmpty]: Start isEmpty. Operand 51961 states and 83562 transitions. [2025-03-08 15:42:17,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-08 15:42:17,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:17,309 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:42:17,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:42:17,309 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:17,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:17,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1907166411, now seen corresponding path program 1 times [2025-03-08 15:42:17,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:17,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159382571] [2025-03-08 15:42:17,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:17,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:17,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-08 15:42:20,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-08 15:42:20,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:20,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:20,804 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 57 proven. 159 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-08 15:42:20,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:42:20,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159382571] [2025-03-08 15:42:20,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159382571] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:42:20,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629489794] [2025-03-08 15:42:20,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:20,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:42:20,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:42:20,807 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:42:20,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 15:42:20,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-08 15:42:21,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-08 15:42:21,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:21,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:21,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 15:42:21,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:42:22,757 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 1951 proven. 195 refuted. 0 times theorem prover too weak. 8366 trivial. 0 not checked. [2025-03-08 15:42:22,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:42:23,528 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 21 proven. 195 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-08 15:42:23,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629489794] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:42:23,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:42:23,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 8] total 17 [2025-03-08 15:42:23,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326084871] [2025-03-08 15:42:23,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:42:23,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 15:42:23,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:42:23,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 15:42:23,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-03-08 15:42:23,531 INFO L87 Difference]: Start difference. First operand 51961 states and 83562 transitions. Second operand has 17 states, 17 states have (on average 19.294117647058822) internal successors, (328), 17 states have internal predecessors, (328), 8 states have call successors, (219), 4 states have call predecessors, (219), 7 states have return successors, (219), 8 states have call predecessors, (219), 8 states have call successors, (219) [2025-03-08 15:42:26,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:42:26,384 INFO L93 Difference]: Finished difference Result 95707 states and 152387 transitions. [2025-03-08 15:42:26,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 15:42:26,385 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 19.294117647058822) internal successors, (328), 17 states have internal predecessors, (328), 8 states have call successors, (219), 4 states have call predecessors, (219), 7 states have return successors, (219), 8 states have call predecessors, (219), 8 states have call successors, (219) Word has length 494 [2025-03-08 15:42:26,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:42:26,488 INFO L225 Difference]: With dead ends: 95707 [2025-03-08 15:42:26,488 INFO L226 Difference]: Without dead ends: 43709 [2025-03-08 15:42:26,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1017 GetRequests, 979 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=393, Invalid=1167, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 15:42:26,536 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 2262 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 1548 mSolverCounterSat, 563 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2262 SdHoareTripleChecker+Valid, 1817 SdHoareTripleChecker+Invalid, 2111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 563 IncrementalHoareTripleChecker+Valid, 1548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:42:26,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2262 Valid, 1817 Invalid, 2111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [563 Valid, 1548 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 15:42:26,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43709 states. [2025-03-08 15:42:27,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43709 to 28273. [2025-03-08 15:42:27,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28273 states, 25584 states have (on average 1.568792995622264) internal successors, (40136), 25707 states have internal predecessors, (40136), 2376 states have call successors, (2376), 312 states have call predecessors, (2376), 312 states have return successors, (2376), 2253 states have call predecessors, (2376), 2376 states have call successors, (2376) [2025-03-08 15:42:27,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28273 states to 28273 states and 44888 transitions. [2025-03-08 15:42:27,959 INFO L78 Accepts]: Start accepts. Automaton has 28273 states and 44888 transitions. Word has length 494 [2025-03-08 15:42:27,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:42:27,960 INFO L471 AbstractCegarLoop]: Abstraction has 28273 states and 44888 transitions. [2025-03-08 15:42:27,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 19.294117647058822) internal successors, (328), 17 states have internal predecessors, (328), 8 states have call successors, (219), 4 states have call predecessors, (219), 7 states have return successors, (219), 8 states have call predecessors, (219), 8 states have call successors, (219) [2025-03-08 15:42:27,960 INFO L276 IsEmpty]: Start isEmpty. Operand 28273 states and 44888 transitions. [2025-03-08 15:42:27,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-08 15:42:27,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:27,981 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:42:27,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 15:42:28,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 15:42:28,185 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:28,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:28,186 INFO L85 PathProgramCache]: Analyzing trace with hash 727602743, now seen corresponding path program 1 times [2025-03-08 15:42:28,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:28,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965181785] [2025-03-08 15:42:28,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:28,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:28,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-08 15:42:28,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-08 15:42:28,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:28,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:28,949 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 15:42:28,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:42:28,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965181785] [2025-03-08 15:42:28,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965181785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:42:28,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:42:28,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:42:28,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12549655] [2025-03-08 15:42:28,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:42:28,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:42:28,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:42:28,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:42:28,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:42:28,951 INFO L87 Difference]: Start difference. First operand 28273 states and 44888 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:42:29,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:42:29,687 INFO L93 Difference]: Finished difference Result 41097 states and 65267 transitions. [2025-03-08 15:42:29,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:42:29,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 494 [2025-03-08 15:42:29,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:42:29,731 INFO L225 Difference]: With dead ends: 41097 [2025-03-08 15:42:29,731 INFO L226 Difference]: Without dead ends: 12827 [2025-03-08 15:42:29,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:42:29,764 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 431 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:42:29,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1166 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:42:29,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12827 states. [2025-03-08 15:42:30,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12827 to 12797. [2025-03-08 15:42:30,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12797 states, 11014 states have (on average 1.5331396404575994) internal successors, (16886), 11066 states have internal predecessors, (16886), 1621 states have call successors, (1621), 161 states have call predecessors, (1621), 161 states have return successors, (1621), 1569 states have call predecessors, (1621), 1621 states have call successors, (1621) [2025-03-08 15:42:30,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12797 states to 12797 states and 20128 transitions. [2025-03-08 15:42:30,740 INFO L78 Accepts]: Start accepts. Automaton has 12797 states and 20128 transitions. Word has length 494 [2025-03-08 15:42:30,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:42:30,740 INFO L471 AbstractCegarLoop]: Abstraction has 12797 states and 20128 transitions. [2025-03-08 15:42:30,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:42:30,740 INFO L276 IsEmpty]: Start isEmpty. Operand 12797 states and 20128 transitions. [2025-03-08 15:42:30,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-08 15:42:30,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:30,750 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:42:30,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:42:30,751 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:30,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:30,751 INFO L85 PathProgramCache]: Analyzing trace with hash -129153066, now seen corresponding path program 1 times [2025-03-08 15:42:30,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:30,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966009949] [2025-03-08 15:42:30,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:30,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:30,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-08 15:42:30,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-08 15:42:30,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:30,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:32,540 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 15:42:32,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:42:32,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966009949] [2025-03-08 15:42:32,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966009949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:42:32,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:42:32,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 15:42:32,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224911130] [2025-03-08 15:42:32,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:42:32,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 15:42:32,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:42:32,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 15:42:32,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:42:32,541 INFO L87 Difference]: Start difference. First operand 12797 states and 20128 transitions. Second operand has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 3 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 3 states have call predecessors, (73), 3 states have call successors, (73) [2025-03-08 15:42:36,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:42:36,113 INFO L93 Difference]: Finished difference Result 41135 states and 64654 transitions. [2025-03-08 15:42:36,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 15:42:36,113 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 3 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 3 states have call predecessors, (73), 3 states have call successors, (73) Word has length 494 [2025-03-08 15:42:36,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:42:36,182 INFO L225 Difference]: With dead ends: 41135 [2025-03-08 15:42:36,182 INFO L226 Difference]: Without dead ends: 28477 [2025-03-08 15:42:36,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-08 15:42:36,207 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 2435 mSDsluCounter, 4383 mSDsCounter, 0 mSdLazyCounter, 2196 mSolverCounterSat, 491 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2435 SdHoareTripleChecker+Valid, 5052 SdHoareTripleChecker+Invalid, 2687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 491 IncrementalHoareTripleChecker+Valid, 2196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:42:36,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2435 Valid, 5052 Invalid, 2687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [491 Valid, 2196 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 15:42:36,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28477 states. [2025-03-08 15:42:37,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28477 to 19324. [2025-03-08 15:42:37,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19324 states, 17457 states have (on average 1.5428767829523973) internal successors, (26934), 17521 states have internal predecessors, (26934), 1681 states have call successors, (1681), 185 states have call predecessors, (1681), 185 states have return successors, (1681), 1617 states have call predecessors, (1681), 1681 states have call successors, (1681) [2025-03-08 15:42:37,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19324 states to 19324 states and 30296 transitions. [2025-03-08 15:42:37,151 INFO L78 Accepts]: Start accepts. Automaton has 19324 states and 30296 transitions. Word has length 494 [2025-03-08 15:42:37,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:42:37,152 INFO L471 AbstractCegarLoop]: Abstraction has 19324 states and 30296 transitions. [2025-03-08 15:42:37,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 3 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 3 states have call predecessors, (73), 3 states have call successors, (73) [2025-03-08 15:42:37,152 INFO L276 IsEmpty]: Start isEmpty. Operand 19324 states and 30296 transitions. [2025-03-08 15:42:37,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-08 15:42:37,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:37,164 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:42:37,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:42:37,164 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:37,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:37,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1378398743, now seen corresponding path program 1 times [2025-03-08 15:42:37,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:37,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456271173] [2025-03-08 15:42:37,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:37,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:37,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-08 15:42:37,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-08 15:42:37,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:37,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:37,736 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 15:42:37,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:42:37,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456271173] [2025-03-08 15:42:37,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456271173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:42:37,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:42:37,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:42:37,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699178916] [2025-03-08 15:42:37,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:42:37,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:42:37,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:42:37,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:42:37,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:42:37,738 INFO L87 Difference]: Start difference. First operand 19324 states and 30296 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:42:38,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:42:38,833 INFO L93 Difference]: Finished difference Result 54400 states and 85661 transitions. [2025-03-08 15:42:38,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:42:38,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 494 [2025-03-08 15:42:38,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:42:38,896 INFO L225 Difference]: With dead ends: 54400 [2025-03-08 15:42:38,896 INFO L226 Difference]: Without dead ends: 35215 [2025-03-08 15:42:38,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:42:38,929 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 511 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:42:38,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 1434 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:42:38,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35215 states. [2025-03-08 15:42:39,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35215 to 34059. [2025-03-08 15:42:40,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34059 states, 31616 states have (on average 1.563448886639676) internal successors, (49430), 31701 states have internal predecessors, (49430), 2209 states have call successors, (2209), 233 states have call predecessors, (2209), 233 states have return successors, (2209), 2124 states have call predecessors, (2209), 2209 states have call successors, (2209) [2025-03-08 15:42:40,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34059 states to 34059 states and 53848 transitions. [2025-03-08 15:42:40,255 INFO L78 Accepts]: Start accepts. Automaton has 34059 states and 53848 transitions. Word has length 494 [2025-03-08 15:42:40,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:42:40,256 INFO L471 AbstractCegarLoop]: Abstraction has 34059 states and 53848 transitions. [2025-03-08 15:42:40,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:42:40,256 INFO L276 IsEmpty]: Start isEmpty. Operand 34059 states and 53848 transitions. [2025-03-08 15:42:40,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2025-03-08 15:42:40,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:40,268 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:42:40,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 15:42:40,269 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:40,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:40,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1857130922, now seen corresponding path program 1 times [2025-03-08 15:42:40,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:40,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555424289] [2025-03-08 15:42:40,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:40,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:40,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 495 statements into 1 equivalence classes. [2025-03-08 15:42:40,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 495 of 495 statements. [2025-03-08 15:42:40,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:40,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:41,225 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 15:42:41,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:42:41,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555424289] [2025-03-08 15:42:41,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555424289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:42:41,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:42:41,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:42:41,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422431628] [2025-03-08 15:42:41,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:42:41,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:42:41,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:42:41,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:42:41,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:42:41,229 INFO L87 Difference]: Start difference. First operand 34059 states and 53848 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:42:42,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:42:42,760 INFO L93 Difference]: Finished difference Result 70967 states and 111718 transitions. [2025-03-08 15:42:42,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:42:42,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 495 [2025-03-08 15:42:42,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:42:42,827 INFO L225 Difference]: With dead ends: 70967 [2025-03-08 15:42:42,827 INFO L226 Difference]: Without dead ends: 37047 [2025-03-08 15:42:42,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-08 15:42:42,869 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 748 mSDsluCounter, 1553 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 2127 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:42:42,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 2127 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:42:42,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37047 states. [2025-03-08 15:42:44,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37047 to 34467. [2025-03-08 15:42:44,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34467 states, 31864 states have (on average 1.5463846346974641) internal successors, (49274), 31957 states have internal predecessors, (49274), 2353 states have call successors, (2353), 249 states have call predecessors, (2353), 249 states have return successors, (2353), 2260 states have call predecessors, (2353), 2353 states have call successors, (2353) [2025-03-08 15:42:44,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34467 states to 34467 states and 53980 transitions. [2025-03-08 15:42:44,289 INFO L78 Accepts]: Start accepts. Automaton has 34467 states and 53980 transitions. Word has length 495 [2025-03-08 15:42:44,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:42:44,290 INFO L471 AbstractCegarLoop]: Abstraction has 34467 states and 53980 transitions. [2025-03-08 15:42:44,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:42:44,290 INFO L276 IsEmpty]: Start isEmpty. Operand 34467 states and 53980 transitions. [2025-03-08 15:42:44,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2025-03-08 15:42:44,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:44,304 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:42:44,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 15:42:44,304 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:44,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:44,304 INFO L85 PathProgramCache]: Analyzing trace with hash -395550923, now seen corresponding path program 1 times [2025-03-08 15:42:44,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:44,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359890099] [2025-03-08 15:42:44,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:44,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:44,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 495 statements into 1 equivalence classes. [2025-03-08 15:42:45,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 495 of 495 statements. [2025-03-08 15:42:45,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:45,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:47,999 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 15 proven. 201 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-08 15:42:47,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:42:47,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359890099] [2025-03-08 15:42:47,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359890099] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:42:47,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148875083] [2025-03-08 15:42:47,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:47,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:42:47,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:42:48,001 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:42:48,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 15:42:48,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 495 statements into 1 equivalence classes. [2025-03-08 15:42:48,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 495 of 495 statements. [2025-03-08 15:42:48,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:48,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:48,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 15:42:48,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:42:49,295 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 4516 proven. 150 refuted. 0 times theorem prover too weak. 5846 trivial. 0 not checked. [2025-03-08 15:42:49,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:42:50,063 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 66 proven. 150 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-08 15:42:50,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148875083] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:42:50,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:42:50,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7, 8] total 33 [2025-03-08 15:42:50,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17764269] [2025-03-08 15:42:50,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:42:50,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-08 15:42:50,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:42:50,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-08 15:42:50,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 15:42:50,066 INFO L87 Difference]: Start difference. First operand 34467 states and 53980 transitions. Second operand has 33 states, 32 states have (on average 10.96875) internal successors, (351), 33 states have internal predecessors, (351), 10 states have call successors, (219), 3 states have call predecessors, (219), 6 states have return successors, (219), 9 states have call predecessors, (219), 10 states have call successors, (219)