./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-66.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 366cd04e1cccaa3d248693408475f1d8f6198ae7da412e5cc3eb2ead8f221652 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:37:11,527 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:37:11,580 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:37:11,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:37:11,587 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:37:11,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:37:11,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:37:11,608 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:37:11,608 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:37:11,608 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:37:11,609 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:37:11,609 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:37:11,609 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:37:11,609 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:37:11,610 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:37:11,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:37:11,610 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:37:11,610 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:37:11,610 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:37:11,610 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:37:11,610 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:37:11,610 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:37:11,610 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:37:11,610 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:37:11,610 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:37:11,610 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:37:11,610 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:37:11,610 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:37:11,611 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:37:11,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:37:11,611 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:37:11,611 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:37:11,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:37:11,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:37:11,611 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:37:11,612 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:37:11,612 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:37:11,612 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:37:11,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:37:11,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:37:11,612 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:37:11,612 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:37:11,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:37:11,612 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 -> 366cd04e1cccaa3d248693408475f1d8f6198ae7da412e5cc3eb2ead8f221652 [2025-03-17 01:37:11,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:37:11,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:37:11,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:37:11,834 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:37:11,834 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:37:11,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-66.i [2025-03-17 01:37:12,981 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b20f59724/3ebd19d185564a4da958ffb492099002/FLAG71e8d5414 [2025-03-17 01:37:13,249 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:37:13,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-66.i [2025-03-17 01:37:13,257 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b20f59724/3ebd19d185564a4da958ffb492099002/FLAG71e8d5414 [2025-03-17 01:37:13,582 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b20f59724/3ebd19d185564a4da958ffb492099002 [2025-03-17 01:37:13,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:37:13,590 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:37:13,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:37:13,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:37:13,597 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:37:13,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:37:13" (1/1) ... [2025-03-17 01:37:13,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ce57e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:37:13, skipping insertion in model container [2025-03-17 01:37:13,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:37:13" (1/1) ... [2025-03-17 01:37:13,618 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:37:13,715 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-66.i[919,932] [2025-03-17 01:37:13,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:37:13,790 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:37:13,801 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-66.i[919,932] [2025-03-17 01:37:13,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:37:13,843 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:37:13,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:37:13 WrapperNode [2025-03-17 01:37:13,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:37:13,845 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:37:13,845 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:37:13,845 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:37:13,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:37:13" (1/1) ... [2025-03-17 01:37:13,858 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:37:13" (1/1) ... [2025-03-17 01:37:13,880 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 250 [2025-03-17 01:37:13,880 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:37:13,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:37:13,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:37:13,881 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:37:13,887 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:37:13" (1/1) ... [2025-03-17 01:37:13,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:37:13" (1/1) ... [2025-03-17 01:37:13,889 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:37:13" (1/1) ... [2025-03-17 01:37:13,901 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 01:37:13,902 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:37:13" (1/1) ... [2025-03-17 01:37:13,902 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:37:13" (1/1) ... [2025-03-17 01:37:13,908 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:37:13" (1/1) ... [2025-03-17 01:37:13,909 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:37:13" (1/1) ... [2025-03-17 01:37:13,910 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:37:13" (1/1) ... [2025-03-17 01:37:13,911 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:37:13" (1/1) ... [2025-03-17 01:37:13,913 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:37:13,914 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:37:13,914 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:37:13,914 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:37:13,915 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:37:13" (1/1) ... [2025-03-17 01:37:13,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:37:13,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:37:13,943 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 01:37:13,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 01:37:13,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:37:13,963 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:37:13,963 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:37:13,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:37:13,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:37:13,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:37:14,025 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:37:14,027 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:37:14,419 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-17 01:37:14,420 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:37:14,431 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:37:14,432 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:37:14,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:37:14 BoogieIcfgContainer [2025-03-17 01:37:14,433 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:37:14,435 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:37:14,436 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:37:14,439 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:37:14,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:37:13" (1/3) ... [2025-03-17 01:37:14,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b49205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:37:14, skipping insertion in model container [2025-03-17 01:37:14,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:37:13" (2/3) ... [2025-03-17 01:37:14,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b49205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:37:14, skipping insertion in model container [2025-03-17 01:37:14,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:37:14" (3/3) ... [2025-03-17 01:37:14,442 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-66.i [2025-03-17 01:37:14,454 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:37:14,456 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-66.i that has 2 procedures, 108 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:37:14,496 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:37:14,504 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;@1a85018d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:37:14,504 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:37:14,508 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 62 states have internal predecessors, (88), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 01:37:14,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-17 01:37:14,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:37:14,522 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:37:14,522 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:37:14,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:37:14,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1814293224, now seen corresponding path program 1 times [2025-03-17 01:37:14,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:37:14,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740584555] [2025-03-17 01:37:14,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:37:14,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:37:14,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-17 01:37:14,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-17 01:37:14,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:37:14,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:37:14,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2025-03-17 01:37:14,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:37:14,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740584555] [2025-03-17 01:37:14,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740584555] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:37:14,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418654288] [2025-03-17 01:37:14,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:37:14,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:37:14,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:37:14,847 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:37:14,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 01:37:14,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-17 01:37:15,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-17 01:37:15,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:37:15,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:37:15,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:37:15,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:37:15,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2025-03-17 01:37:15,098 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:37:15,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418654288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:37:15,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:37:15,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 01:37:15,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543791830] [2025-03-17 01:37:15,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:37:15,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:37:15,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:37:15,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:37:15,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:37:15,120 INFO L87 Difference]: Start difference. First operand has 108 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 62 states have internal predecessors, (88), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-17 01:37:15,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:37:15,153 INFO L93 Difference]: Finished difference Result 213 states and 394 transitions. [2025-03-17 01:37:15,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:37:15,156 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) Word has length 266 [2025-03-17 01:37:15,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:37:15,163 INFO L225 Difference]: With dead ends: 213 [2025-03-17 01:37:15,165 INFO L226 Difference]: Without dead ends: 106 [2025-03-17 01:37:15,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:37:15,172 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:37:15,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:37:15,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-17 01:37:15,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-17 01:37:15,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 01:37:15,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 172 transitions. [2025-03-17 01:37:15,213 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 172 transitions. Word has length 266 [2025-03-17 01:37:15,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:37:15,213 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 172 transitions. [2025-03-17 01:37:15,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-17 01:37:15,213 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 172 transitions. [2025-03-17 01:37:15,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-17 01:37:15,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:37:15,218 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:37:15,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 01:37:15,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 01:37:15,423 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:37:15,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:37:15,424 INFO L85 PathProgramCache]: Analyzing trace with hash -941319430, now seen corresponding path program 1 times [2025-03-17 01:37:15,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:37:15,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454887757] [2025-03-17 01:37:15,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:37:15,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:37:15,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-17 01:37:15,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-17 01:37:15,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:37:15,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:37:35,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-17 01:37:35,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:37:35,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454887757] [2025-03-17 01:37:35,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454887757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:37:35,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:37:35,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 01:37:35,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556744331] [2025-03-17 01:37:35,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:37:35,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 01:37:35,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:37:35,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 01:37:35,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-17 01:37:35,312 INFO L87 Difference]: Start difference. First operand 106 states and 172 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 01:37:36,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:37:36,128 INFO L93 Difference]: Finished difference Result 348 states and 553 transitions. [2025-03-17 01:37:36,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 01:37:36,129 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 266 [2025-03-17 01:37:36,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:37:36,132 INFO L225 Difference]: With dead ends: 348 [2025-03-17 01:37:36,132 INFO L226 Difference]: Without dead ends: 243 [2025-03-17 01:37:36,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:37:36,133 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 273 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 01:37:36,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 868 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 01:37:36,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-17 01:37:36,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 174. [2025-03-17 01:37:36,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 123 states have (on average 1.5121951219512195) internal successors, (186), 124 states have internal predecessors, (186), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 01:37:36,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 282 transitions. [2025-03-17 01:37:36,156 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 282 transitions. Word has length 266 [2025-03-17 01:37:36,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:37:36,160 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 282 transitions. [2025-03-17 01:37:36,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 01:37:36,161 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 282 transitions. [2025-03-17 01:37:36,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-17 01:37:36,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:37:36,164 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:37:36,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 01:37:36,164 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:37:36,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:37:36,164 INFO L85 PathProgramCache]: Analyzing trace with hash -941289639, now seen corresponding path program 1 times [2025-03-17 01:37:36,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:37:36,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128041263] [2025-03-17 01:37:36,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:37:36,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:37:36,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-17 01:37:36,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-17 01:37:36,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:37:36,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:38:02,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-17 01:38:02,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:38:02,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128041263] [2025-03-17 01:38:02,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128041263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:38:02,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:38:02,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 01:38:02,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968883734] [2025-03-17 01:38:02,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:38:02,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 01:38:02,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:38:02,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 01:38:02,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:38:02,162 INFO L87 Difference]: Start difference. First operand 174 states and 282 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 01:38:04,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:38:04,503 INFO L93 Difference]: Finished difference Result 232 states and 360 transitions. [2025-03-17 01:38:04,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 01:38:04,504 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 266 [2025-03-17 01:38:04,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:38:04,507 INFO L225 Difference]: With dead ends: 232 [2025-03-17 01:38:04,507 INFO L226 Difference]: Without dead ends: 230 [2025-03-17 01:38:04,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-17 01:38:04,508 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 211 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 01:38:04,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 1058 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 01:38:04,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-17 01:38:04,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 174. [2025-03-17 01:38:04,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 123 states have (on average 1.5121951219512195) internal successors, (186), 124 states have internal predecessors, (186), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 01:38:04,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 282 transitions. [2025-03-17 01:38:04,529 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 282 transitions. Word has length 266 [2025-03-17 01:38:04,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:38:04,530 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 282 transitions. [2025-03-17 01:38:04,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 01:38:04,531 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 282 transitions. [2025-03-17 01:38:04,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-17 01:38:04,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:38:04,533 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:38:04,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 01:38:04,533 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:38:04,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:38:04,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1556696507, now seen corresponding path program 1 times [2025-03-17 01:38:04,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:38:04,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993796836] [2025-03-17 01:38:04,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:38:04,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:38:04,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-17 01:38:04,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-17 01:38:04,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:38:04,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:38:20,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-17 01:38:20,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:38:20,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993796836] [2025-03-17 01:38:20,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993796836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:38:20,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:38:20,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 01:38:20,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278693254] [2025-03-17 01:38:20,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:38:20,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 01:38:20,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:38:20,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 01:38:20,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-17 01:38:20,736 INFO L87 Difference]: Start difference. First operand 174 states and 282 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 01:38:21,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:38:21,303 INFO L93 Difference]: Finished difference Result 243 states and 374 transitions. [2025-03-17 01:38:21,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 01:38:21,303 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 266 [2025-03-17 01:38:21,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:38:21,305 INFO L225 Difference]: With dead ends: 243 [2025-03-17 01:38:21,305 INFO L226 Difference]: Without dead ends: 241 [2025-03-17 01:38:21,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:38:21,306 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 259 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 01:38:21,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1031 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 01:38:21,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-17 01:38:21,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 183. [2025-03-17 01:38:21,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 132 states have (on average 1.5151515151515151) internal successors, (200), 133 states have internal predecessors, (200), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 01:38:21,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 296 transitions. [2025-03-17 01:38:21,318 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 296 transitions. Word has length 266 [2025-03-17 01:38:21,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:38:21,322 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 296 transitions. [2025-03-17 01:38:21,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 01:38:21,323 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 296 transitions. [2025-03-17 01:38:21,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-17 01:38:21,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:38:21,324 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:38:21,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 01:38:21,324 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:38:21,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:38:21,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1556726298, now seen corresponding path program 1 times [2025-03-17 01:38:21,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:38:21,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68236934] [2025-03-17 01:38:21,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:38:21,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:38:21,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-17 01:38:21,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-17 01:38:21,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:38:21,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:38:25,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-17 01:38:25,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:38:25,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68236934] [2025-03-17 01:38:25,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68236934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:38:25,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:38:25,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 01:38:25,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633996290] [2025-03-17 01:38:25,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:38:25,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 01:38:25,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:38:25,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 01:38:25,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:38:25,202 INFO L87 Difference]: Start difference. First operand 183 states and 296 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 01:38:25,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:38:25,788 INFO L93 Difference]: Finished difference Result 253 states and 386 transitions. [2025-03-17 01:38:25,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 01:38:25,788 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 266 [2025-03-17 01:38:25,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:38:25,790 INFO L225 Difference]: With dead ends: 253 [2025-03-17 01:38:25,790 INFO L226 Difference]: Without dead ends: 251 [2025-03-17 01:38:25,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:38:25,791 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 292 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 01:38:25,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 963 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 01:38:25,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-17 01:38:25,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 183. [2025-03-17 01:38:25,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 132 states have (on average 1.5151515151515151) internal successors, (200), 133 states have internal predecessors, (200), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 01:38:25,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 296 transitions. [2025-03-17 01:38:25,807 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 296 transitions. Word has length 266 [2025-03-17 01:38:25,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:38:25,810 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 296 transitions. [2025-03-17 01:38:25,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 01:38:25,810 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 296 transitions. [2025-03-17 01:38:25,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-17 01:38:25,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:38:25,812 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:38:25,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 01:38:25,813 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:38:25,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:38:25,813 INFO L85 PathProgramCache]: Analyzing trace with hash 566232379, now seen corresponding path program 1 times [2025-03-17 01:38:25,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:38:25,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349396729] [2025-03-17 01:38:25,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:38:25,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:38:25,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-17 01:38:25,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-17 01:38:25,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:38:25,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:38:25,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-17 01:38:25,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:38:25,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349396729] [2025-03-17 01:38:25,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349396729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:38:25,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:38:25,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:38:25,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525946944] [2025-03-17 01:38:25,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:38:25,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:38:25,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:38:25,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:38:25,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:38:25,893 INFO L87 Difference]: Start difference. First operand 183 states and 296 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 01:38:25,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:38:25,957 INFO L93 Difference]: Finished difference Result 507 states and 822 transitions. [2025-03-17 01:38:25,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:38:25,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 266 [2025-03-17 01:38:25,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:38:25,960 INFO L225 Difference]: With dead ends: 507 [2025-03-17 01:38:25,961 INFO L226 Difference]: Without dead ends: 325 [2025-03-17 01:38:25,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:38:25,962 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 160 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:38:25,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 482 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:38:25,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-17 01:38:25,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2025-03-17 01:38:25,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 222 states have (on average 1.4594594594594594) internal successors, (324), 224 states have internal predecessors, (324), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 94 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-17 01:38:25,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 516 transitions. [2025-03-17 01:38:25,990 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 516 transitions. Word has length 266 [2025-03-17 01:38:25,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:38:25,991 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 516 transitions. [2025-03-17 01:38:25,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 01:38:25,992 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 516 transitions. [2025-03-17 01:38:25,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-17 01:38:25,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:38:25,993 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:38:25,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 01:38:25,994 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:38:25,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:38:25,994 INFO L85 PathProgramCache]: Analyzing trace with hash 369718874, now seen corresponding path program 1 times [2025-03-17 01:38:25,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:38:25,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638917385] [2025-03-17 01:38:25,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:38:25,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:38:26,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-17 01:38:26,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-17 01:38:26,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:38:26,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:38:26,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-17 01:38:26,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:38:26,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638917385] [2025-03-17 01:38:26,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638917385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:38:26,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:38:26,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:38:26,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771569056] [2025-03-17 01:38:26,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:38:26,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:38:26,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:38:26,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:38:26,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:38:26,175 INFO L87 Difference]: Start difference. First operand 323 states and 516 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 01:38:26,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:38:26,445 INFO L93 Difference]: Finished difference Result 938 states and 1483 transitions. [2025-03-17 01:38:26,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:38:26,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 266 [2025-03-17 01:38:26,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:38:26,452 INFO L225 Difference]: With dead ends: 938 [2025-03-17 01:38:26,452 INFO L226 Difference]: Without dead ends: 616 [2025-03-17 01:38:26,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:38:26,454 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 122 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:38:26,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 546 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:38:26,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-03-17 01:38:26,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 569. [2025-03-17 01:38:26,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 372 states have (on average 1.4274193548387097) internal successors, (531), 375 states have internal predecessors, (531), 188 states have call successors, (188), 8 states have call predecessors, (188), 8 states have return successors, (188), 185 states have call predecessors, (188), 188 states have call successors, (188) [2025-03-17 01:38:26,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 907 transitions. [2025-03-17 01:38:26,506 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 907 transitions. Word has length 266 [2025-03-17 01:38:26,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:38:26,507 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 907 transitions. [2025-03-17 01:38:26,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 01:38:26,507 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 907 transitions. [2025-03-17 01:38:26,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-17 01:38:26,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:38:26,510 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:38:26,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 01:38:26,510 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:38:26,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:38:26,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1427232485, now seen corresponding path program 1 times [2025-03-17 01:38:26,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:38:26,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485030569] [2025-03-17 01:38:26,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:38:26,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:38:26,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-17 01:38:26,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-17 01:38:26,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:38:26,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:38:28,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-17 01:38:28,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:38:28,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485030569] [2025-03-17 01:38:28,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485030569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:38:28,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:38:28,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 01:38:28,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543273331] [2025-03-17 01:38:28,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:38:28,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 01:38:28,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:38:28,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 01:38:28,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:38:28,310 INFO L87 Difference]: Start difference. First operand 569 states and 907 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 01:38:28,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:38:28,862 INFO L93 Difference]: Finished difference Result 726 states and 1103 transitions. [2025-03-17 01:38:28,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 01:38:28,862 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 266 [2025-03-17 01:38:28,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:38:28,866 INFO L225 Difference]: With dead ends: 726 [2025-03-17 01:38:28,866 INFO L226 Difference]: Without dead ends: 724 [2025-03-17 01:38:28,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2025-03-17 01:38:28,867 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 427 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 01:38:28,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 767 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 01:38:28,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-03-17 01:38:28,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 635. [2025-03-17 01:38:28,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 427 states have (on average 1.4192037470725996) internal successors, (606), 432 states have internal predecessors, (606), 196 states have call successors, (196), 11 states have call predecessors, (196), 11 states have return successors, (196), 191 states have call predecessors, (196), 196 states have call successors, (196) [2025-03-17 01:38:28,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 998 transitions. [2025-03-17 01:38:28,926 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 998 transitions. Word has length 266 [2025-03-17 01:38:28,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:38:28,926 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 998 transitions. [2025-03-17 01:38:28,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 01:38:28,927 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 998 transitions. [2025-03-17 01:38:28,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-17 01:38:28,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:38:28,930 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:38:28,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 01:38:28,930 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:38:28,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:38:28,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1427202694, now seen corresponding path program 1 times [2025-03-17 01:38:28,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:38:28,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518226333] [2025-03-17 01:38:28,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:38:28,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:38:28,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-17 01:38:28,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-17 01:38:28,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:38:28,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:38:31,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-17 01:38:31,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:38:31,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518226333] [2025-03-17 01:38:31,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518226333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:38:31,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:38:31,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 01:38:31,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449235939] [2025-03-17 01:38:31,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:38:31,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 01:38:31,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:38:31,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 01:38:31,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2025-03-17 01:38:31,356 INFO L87 Difference]: Start difference. First operand 635 states and 998 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 01:38:32,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:38:32,520 INFO L93 Difference]: Finished difference Result 724 states and 1101 transitions. [2025-03-17 01:38:32,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 01:38:32,521 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 266 [2025-03-17 01:38:32,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:38:32,524 INFO L225 Difference]: With dead ends: 724 [2025-03-17 01:38:32,524 INFO L226 Difference]: Without dead ends: 722 [2025-03-17 01:38:32,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2025-03-17 01:38:32,526 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 387 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 01:38:32,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 875 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 01:38:32,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2025-03-17 01:38:32,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 635. [2025-03-17 01:38:32,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 427 states have (on average 1.4192037470725996) internal successors, (606), 432 states have internal predecessors, (606), 196 states have call successors, (196), 11 states have call predecessors, (196), 11 states have return successors, (196), 191 states have call predecessors, (196), 196 states have call successors, (196) [2025-03-17 01:38:32,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 998 transitions. [2025-03-17 01:38:32,575 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 998 transitions. Word has length 266 [2025-03-17 01:38:32,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:38:32,576 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 998 transitions. [2025-03-17 01:38:32,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 01:38:32,576 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 998 transitions. [2025-03-17 01:38:32,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-17 01:38:32,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:38:32,578 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:38:32,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 01:38:32,578 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:38:32,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:38:32,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1938391783, now seen corresponding path program 1 times [2025-03-17 01:38:32,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:38:32,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752068981] [2025-03-17 01:38:32,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:38:32,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:38:32,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-17 01:38:32,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-17 01:38:32,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:38:32,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:38:32,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-17 01:38:32,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:38:32,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752068981] [2025-03-17 01:38:32,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752068981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:38:32,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:38:32,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:38:32,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26481597] [2025-03-17 01:38:32,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:38:32,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:38:32,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:38:32,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:38:32,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:38:32,806 INFO L87 Difference]: Start difference. First operand 635 states and 998 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-17 01:38:33,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:38:33,073 INFO L93 Difference]: Finished difference Result 1168 states and 1818 transitions. [2025-03-17 01:38:33,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:38:33,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 266 [2025-03-17 01:38:33,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:38:33,079 INFO L225 Difference]: With dead ends: 1168 [2025-03-17 01:38:33,079 INFO L226 Difference]: Without dead ends: 622 [2025-03-17 01:38:33,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:38:33,081 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 215 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:38:33,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 318 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:38:33,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2025-03-17 01:38:33,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 607. [2025-03-17 01:38:33,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 393 states have (on average 1.366412213740458) internal successors, (537), 398 states have internal predecessors, (537), 200 states have call successors, (200), 13 states have call predecessors, (200), 13 states have return successors, (200), 195 states have call predecessors, (200), 200 states have call successors, (200) [2025-03-17 01:38:33,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 937 transitions. [2025-03-17 01:38:33,144 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 937 transitions. Word has length 266 [2025-03-17 01:38:33,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:38:33,145 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 937 transitions. [2025-03-17 01:38:33,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-17 01:38:33,146 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 937 transitions. [2025-03-17 01:38:33,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-17 01:38:33,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:38:33,147 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:38:33,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 01:38:33,147 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:38:33,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:38:33,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2024878229, now seen corresponding path program 1 times [2025-03-17 01:38:33,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:38:33,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60775723] [2025-03-17 01:38:33,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:38:33,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:38:33,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-17 01:38:33,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-17 01:38:33,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:38:33,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:38:35,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 84 proven. 45 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2025-03-17 01:38:35,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:38:35,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60775723] [2025-03-17 01:38:35,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60775723] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:38:35,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217077101] [2025-03-17 01:38:35,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:38:35,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:38:35,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:38:35,079 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-17 01:38:35,081 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-17 01:38:35,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-17 01:38:35,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-17 01:38:35,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:38:35,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:38:35,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 01:38:35,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:38:35,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1796 proven. 84 refuted. 0 times theorem prover too weak. 1904 trivial. 0 not checked. [2025-03-17 01:38:35,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:38:36,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 168 proven. 87 refuted. 0 times theorem prover too weak. 3529 trivial. 0 not checked. [2025-03-17 01:38:36,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217077101] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:38:36,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 01:38:36,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 24 [2025-03-17 01:38:36,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320295152] [2025-03-17 01:38:36,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 01:38:36,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 01:38:36,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:38:36,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 01:38:36,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2025-03-17 01:38:36,581 INFO L87 Difference]: Start difference. First operand 607 states and 937 transitions. Second operand has 24 states, 22 states have (on average 5.954545454545454) internal successors, (131), 22 states have internal predecessors, (131), 10 states have call successors, (132), 4 states have call predecessors, (132), 8 states have return successors, (132), 9 states have call predecessors, (132), 10 states have call successors, (132) [2025-03-17 01:38:38,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:38:38,590 INFO L93 Difference]: Finished difference Result 1492 states and 2294 transitions. [2025-03-17 01:38:38,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 01:38:38,591 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 5.954545454545454) internal successors, (131), 22 states have internal predecessors, (131), 10 states have call successors, (132), 4 states have call predecessors, (132), 8 states have return successors, (132), 9 states have call predecessors, (132), 10 states have call successors, (132) Word has length 267 [2025-03-17 01:38:38,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:38:38,596 INFO L225 Difference]: With dead ends: 1492 [2025-03-17 01:38:38,597 INFO L226 Difference]: Without dead ends: 969 [2025-03-17 01:38:38,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 524 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=485, Invalid=1321, Unknown=0, NotChecked=0, Total=1806 [2025-03-17 01:38:38,599 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 703 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 658 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 2107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 658 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:38:38,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 1113 Invalid, 2107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [658 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 01:38:38,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2025-03-17 01:38:38,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 626. [2025-03-17 01:38:38,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 409 states have (on average 1.3594132029339854) internal successors, (556), 414 states have internal predecessors, (556), 200 states have call successors, (200), 16 states have call predecessors, (200), 16 states have return successors, (200), 195 states have call predecessors, (200), 200 states have call successors, (200) [2025-03-17 01:38:38,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 956 transitions. [2025-03-17 01:38:38,668 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 956 transitions. Word has length 267 [2025-03-17 01:38:38,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:38:38,669 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 956 transitions. [2025-03-17 01:38:38,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 5.954545454545454) internal successors, (131), 22 states have internal predecessors, (131), 10 states have call successors, (132), 4 states have call predecessors, (132), 8 states have return successors, (132), 9 states have call predecessors, (132), 10 states have call successors, (132) [2025-03-17 01:38:38,669 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 956 transitions. [2025-03-17 01:38:38,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-17 01:38:38,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:38:38,670 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:38:38,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 01:38:38,874 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,SelfDestructingSolverStorable10 [2025-03-17 01:38:38,874 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:38:38,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:38:38,874 INFO L85 PathProgramCache]: Analyzing trace with hash 288518335, now seen corresponding path program 1 times [2025-03-17 01:38:38,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:38:38,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961612991] [2025-03-17 01:38:38,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:38:38,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:38:38,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-17 01:38:38,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-17 01:38:38,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:38:38,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 01:38:38,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [754848220] [2025-03-17 01:38:38,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:38:38,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:38:38,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:38:38,961 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-17 01:38:38,962 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-17 01:38:39,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-17 01:38:39,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-17 01:38:39,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:38:39,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:38:39,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-17 01:38:39,125 INFO L279 TraceCheckSpWp]: Computing forward predicates...