./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-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 75e16fbc6add136470e5a368bd6380d698425fcea4219ad0b84abde2182994d0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:43:30,714 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:43:30,769 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:43:30,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:43:30,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:43:30,794 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:43:30,795 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:43:30,795 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:43:30,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:43:30,796 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:43:30,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:43:30,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:43:30,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:43:30,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:43:30,797 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:43:30,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:43:30,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:43:30,798 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:43:30,798 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:43:30,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:43:30,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:43:30,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:43:30,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:43:30,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:43:30,798 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:43:30,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:43:30,798 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:43:30,799 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:43:30,799 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:43:30,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:43:30,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:43:30,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:43:30,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:43:30,799 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:43:30,799 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:43:30,799 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:43:30,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:43:30,800 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:43:30,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:43:30,800 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:43:30,800 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:43:30,800 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:43:30,800 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:43:30,800 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 -> 75e16fbc6add136470e5a368bd6380d698425fcea4219ad0b84abde2182994d0 [2025-03-03 20:43:30,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:43:30,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:43:31,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:43:31,000 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:43:31,000 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:43:31,001 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-pe-cn_file-66.i [2025-03-03 20:43:32,100 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5607faaf/fcb069f13ce94789b8b2cf642eee93fd/FLAGf1bccdb1d [2025-03-03 20:43:32,325 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:43:32,325 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-66.i [2025-03-03 20:43:32,336 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5607faaf/fcb069f13ce94789b8b2cf642eee93fd/FLAGf1bccdb1d [2025-03-03 20:43:32,658 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5607faaf/fcb069f13ce94789b8b2cf642eee93fd [2025-03-03 20:43:32,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:43:32,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:43:32,661 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:43:32,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:43:32,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:43:32,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:43:32" (1/1) ... [2025-03-03 20:43:32,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2913649e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:32, skipping insertion in model container [2025-03-03 20:43:32,666 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:43:32" (1/1) ... [2025-03-03 20:43:32,679 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:43:32,763 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-pe-cn_file-66.i[919,932] [2025-03-03 20:43:32,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:43:32,818 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:43:32,827 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-pe-cn_file-66.i[919,932] [2025-03-03 20:43:32,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:43:32,881 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:43:32,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:32 WrapperNode [2025-03-03 20:43:32,881 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:43:32,882 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:43:32,882 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:43:32,882 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:43:32,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:32" (1/1) ... [2025-03-03 20:43:32,895 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:32" (1/1) ... [2025-03-03 20:43:32,933 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 250 [2025-03-03 20:43:32,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:43:32,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:43:32,936 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:43:32,936 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:43:32,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:32" (1/1) ... [2025-03-03 20:43:32,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:32" (1/1) ... [2025-03-03 20:43:32,946 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:32" (1/1) ... [2025-03-03 20:43:32,970 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:43:32,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:32" (1/1) ... [2025-03-03 20:43:32,971 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:32" (1/1) ... [2025-03-03 20:43:32,978 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:32" (1/1) ... [2025-03-03 20:43:32,980 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:32" (1/1) ... [2025-03-03 20:43:32,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:32" (1/1) ... [2025-03-03 20:43:32,986 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:32" (1/1) ... [2025-03-03 20:43:32,988 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:43:32,989 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:43:32,989 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:43:32,989 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:43:32,990 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:32" (1/1) ... [2025-03-03 20:43:32,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:43:33,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:43:33,018 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:43:33,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:43:33,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:43:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:43:33,040 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:43:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:43:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:43:33,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:43:33,120 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:43:33,121 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:43:33,524 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 20:43:33,524 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:43:33,533 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:43:33,533 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:43:33,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:43:33 BoogieIcfgContainer [2025-03-03 20:43:33,534 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:43:33,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:43:33,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:43:33,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:43:33,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:43:32" (1/3) ... [2025-03-03 20:43:33,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c95be6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:43:33, skipping insertion in model container [2025-03-03 20:43:33,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:43:32" (2/3) ... [2025-03-03 20:43:33,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c95be6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:43:33, skipping insertion in model container [2025-03-03 20:43:33,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:43:33" (3/3) ... [2025-03-03 20:43:33,541 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-66.i [2025-03-03 20:43:33,551 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:43:33,553 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-66.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:43:33,595 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:43:33,602 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;@7e87b49f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:43:33,603 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:43:33,606 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 67 states have internal predecessors, (93), 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-03 20:43:33,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-03 20:43:33,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:33,619 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, 1, 1] [2025-03-03 20:43:33,620 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:33,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:33,623 INFO L85 PathProgramCache]: Analyzing trace with hash 70421802, now seen corresponding path program 1 times [2025-03-03 20:43:33,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:43:33,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867087677] [2025-03-03 20:43:33,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:33,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:43:33,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-03 20:43:33,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-03 20:43:33,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:33,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:34,013 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-03 20:43:34,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:43:34,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867087677] [2025-03-03 20:43:34,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867087677] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:43:34,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207485858] [2025-03-03 20:43:34,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:34,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:43:34,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:43:34,017 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:43:34,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:43:34,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-03 20:43:34,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-03 20:43:34,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:34,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:34,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:43:34,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:43:34,275 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-03 20:43:34,276 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:43:34,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207485858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:43:34,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:43:34,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:43:34,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201281422] [2025-03-03 20:43:34,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:43:34,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:43:34,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:43:34,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:43:34,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:43:34,298 INFO L87 Difference]: Start difference. First operand has 113 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 67 states have internal predecessors, (93), 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 27.5) internal successors, (55), 2 states have internal predecessors, (55), 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-03 20:43:34,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:43:34,319 INFO L93 Difference]: Finished difference Result 220 states and 401 transitions. [2025-03-03 20:43:34,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:43:34,321 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 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 270 [2025-03-03 20:43:34,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:43:34,325 INFO L225 Difference]: With dead ends: 220 [2025-03-03 20:43:34,326 INFO L226 Difference]: Without dead ends: 110 [2025-03-03 20:43:34,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:43:34,330 INFO L435 NwaCegarLoop]: 176 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, 176 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-03 20:43:34,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:43:34,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-03 20:43:34,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-03 20:43:34,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 64 states have (on average 1.375) internal successors, (88), 64 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-03 20:43:34,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 176 transitions. [2025-03-03 20:43:34,362 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 176 transitions. Word has length 270 [2025-03-03 20:43:34,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:43:34,362 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 176 transitions. [2025-03-03 20:43:34,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 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-03 20:43:34,362 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 176 transitions. [2025-03-03 20:43:34,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-03 20:43:34,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:34,367 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, 1, 1] [2025-03-03 20:43:34,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 20:43:34,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:43:34,568 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:34,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:34,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1362805640, now seen corresponding path program 1 times [2025-03-03 20:43:34,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:43:34,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698438605] [2025-03-03 20:43:34,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:34,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:43:34,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-03 20:43:34,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-03 20:43:34,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:34,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:43:40,074 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-03 20:43:40,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:43:40,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698438605] [2025-03-03 20:43:40,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698438605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:43:40,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:43:40,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 20:43:40,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480964539] [2025-03-03 20:43:40,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:43:40,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 20:43:40,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:43:40,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 20:43:40,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:43:40,079 INFO L87 Difference]: Start difference. First operand 110 states and 176 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 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-03 20:43:40,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:43:40,924 INFO L93 Difference]: Finished difference Result 429 states and 681 transitions. [2025-03-03 20:43:40,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 20:43:40,926 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 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 270 [2025-03-03 20:43:40,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:43:40,930 INFO L225 Difference]: With dead ends: 429 [2025-03-03 20:43:40,931 INFO L226 Difference]: Without dead ends: 322 [2025-03-03 20:43:40,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-03 20:43:40,932 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 454 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:43:40,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1198 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:43:40,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-03-03 20:43:40,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 181. [2025-03-03 20:43:40,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 130 states have (on average 1.4923076923076923) internal successors, (194), 131 states have internal predecessors, (194), 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-03 20:43:40,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 290 transitions. [2025-03-03 20:43:40,977 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 290 transitions. Word has length 270 [2025-03-03 20:43:40,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:43:40,978 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 290 transitions. [2025-03-03 20:43:40,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 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-03 20:43:40,978 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 290 transitions. [2025-03-03 20:43:40,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-03 20:43:40,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:43:40,980 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, 1, 1] [2025-03-03 20:43:40,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:43:40,981 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:43:40,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:43:40,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1491888359, now seen corresponding path program 1 times [2025-03-03 20:43:40,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:43:40,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648836518] [2025-03-03 20:43:40,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:43:40,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:43:40,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-03 20:43:41,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-03 20:43:41,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:43:41,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:44:09,235 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-03 20:44:09,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:44:09,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648836518] [2025-03-03 20:44:09,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648836518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:44:09,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:44:09,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 20:44:09,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321343444] [2025-03-03 20:44:09,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:44:09,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 20:44:09,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:44:09,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 20:44:09,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-03-03 20:44:09,242 INFO L87 Difference]: Start difference. First operand 181 states and 290 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 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-03 20:44:10,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:44:10,691 INFO L93 Difference]: Finished difference Result 283 states and 447 transitions. [2025-03-03 20:44:10,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 20:44:10,692 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 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 270 [2025-03-03 20:44:10,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:44:10,695 INFO L225 Difference]: With dead ends: 283 [2025-03-03 20:44:10,695 INFO L226 Difference]: Without dead ends: 281 [2025-03-03 20:44:10,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-03 20:44:10,697 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 228 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 20:44:10,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1419 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 20:44:10,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-03 20:44:10,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 182. [2025-03-03 20:44:10,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 131 states have (on average 1.4885496183206106) internal successors, (195), 132 states have internal predecessors, (195), 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-03 20:44:10,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 291 transitions. [2025-03-03 20:44:10,721 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 291 transitions. Word has length 270 [2025-03-03 20:44:10,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:44:10,721 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 291 transitions. [2025-03-03 20:44:10,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 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-03 20:44:10,722 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 291 transitions. [2025-03-03 20:44:10,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-03 20:44:10,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:44:10,724 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, 1, 1] [2025-03-03 20:44:10,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:44:10,724 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:44:10,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:44:10,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1873339817, now seen corresponding path program 1 times [2025-03-03 20:44:10,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:44:10,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593243431] [2025-03-03 20:44:10,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:44:10,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:44:10,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-03 20:44:10,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-03 20:44:10,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:44:10,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:44:13,375 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-03 20:44:13,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:44:13,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593243431] [2025-03-03 20:44:13,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593243431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:44:13,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:44:13,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 20:44:13,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422160364] [2025-03-03 20:44:13,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:44:13,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 20:44:13,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:44:13,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 20:44:13,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:44:13,377 INFO L87 Difference]: Start difference. First operand 182 states and 291 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 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-03 20:44:13,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:44:13,998 INFO L93 Difference]: Finished difference Result 322 states and 500 transitions. [2025-03-03 20:44:13,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 20:44:13,998 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 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 270 [2025-03-03 20:44:13,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:44:14,002 INFO L225 Difference]: With dead ends: 322 [2025-03-03 20:44:14,002 INFO L226 Difference]: Without dead ends: 320 [2025-03-03 20:44:14,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-03 20:44:14,002 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 305 mSDsluCounter, 1432 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1623 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:44:14,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1623 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:44:14,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-03 20:44:14,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 186. [2025-03-03 20:44:14,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 135 states have (on average 1.488888888888889) internal successors, (201), 136 states have internal predecessors, (201), 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-03 20:44:14,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 297 transitions. [2025-03-03 20:44:14,028 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 297 transitions. Word has length 270 [2025-03-03 20:44:14,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:44:14,028 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 297 transitions. [2025-03-03 20:44:14,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 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-03 20:44:14,030 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 297 transitions. [2025-03-03 20:44:14,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-03 20:44:14,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:44:14,033 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, 1, 1] [2025-03-03 20:44:14,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:44:14,033 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:44:14,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:44:14,034 INFO L85 PathProgramCache]: Analyzing trace with hash 2002422536, now seen corresponding path program 1 times [2025-03-03 20:44:14,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:44:14,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468332510] [2025-03-03 20:44:14,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:44:14,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:44:14,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-03 20:44:14,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-03 20:44:14,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:44:14,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:44:17,949 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-03 20:44:17,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:44:17,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468332510] [2025-03-03 20:44:17,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468332510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:44:17,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:44:17,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 20:44:17,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420049724] [2025-03-03 20:44:17,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:44:17,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 20:44:17,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:44:17,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 20:44:17,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-03 20:44:17,951 INFO L87 Difference]: Start difference. First operand 186 states and 297 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 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-03 20:44:19,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:44:19,061 INFO L93 Difference]: Finished difference Result 320 states and 498 transitions. [2025-03-03 20:44:19,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 20:44:19,061 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 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 270 [2025-03-03 20:44:19,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:44:19,063 INFO L225 Difference]: With dead ends: 320 [2025-03-03 20:44:19,063 INFO L226 Difference]: Without dead ends: 318 [2025-03-03 20:44:19,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-03 20:44:19,064 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 327 mSDsluCounter, 2014 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 2237 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 20:44:19,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 2237 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 20:44:19,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-03 20:44:19,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 184. [2025-03-03 20:44:19,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 133 states have (on average 1.4887218045112782) internal successors, (198), 134 states have internal predecessors, (198), 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-03 20:44:19,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 294 transitions. [2025-03-03 20:44:19,080 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 294 transitions. Word has length 270 [2025-03-03 20:44:19,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:44:19,080 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 294 transitions. [2025-03-03 20:44:19,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 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-03 20:44:19,081 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 294 transitions. [2025-03-03 20:44:19,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-03 20:44:19,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:44:19,083 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, 1, 1] [2025-03-03 20:44:19,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:44:19,083 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:44:19,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:44:19,083 INFO L85 PathProgramCache]: Analyzing trace with hash 518333769, now seen corresponding path program 1 times [2025-03-03 20:44:19,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:44:19,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052097086] [2025-03-03 20:44:19,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:44:19,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:44:19,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-03 20:44:19,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-03 20:44:19,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:44:19,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:44:19,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-03 20:44:19,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:44:19,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052097086] [2025-03-03 20:44:19,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052097086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:44:19,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:44:19,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:44:19,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68481097] [2025-03-03 20:44:19,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:44:19,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:44:19,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:44:19,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:44:19,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:44:19,161 INFO L87 Difference]: Start difference. First operand 184 states and 294 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-03 20:44:19,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:44:19,196 INFO L93 Difference]: Finished difference Result 511 states and 820 transitions. [2025-03-03 20:44:19,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:44:19,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 270 [2025-03-03 20:44:19,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:44:19,199 INFO L225 Difference]: With dead ends: 511 [2025-03-03 20:44:19,199 INFO L226 Difference]: Without dead ends: 330 [2025-03-03 20:44:19,200 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-03 20:44:19,201 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 163 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 492 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-03 20:44:19,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 492 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:44:19,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-03 20:44:19,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2025-03-03 20:44:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 227 states have (on average 1.4361233480176212) internal successors, (326), 229 states have internal predecessors, (326), 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-03 20:44:19,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 518 transitions. [2025-03-03 20:44:19,222 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 518 transitions. Word has length 270 [2025-03-03 20:44:19,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:44:19,224 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 518 transitions. [2025-03-03 20:44:19,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-03 20:44:19,224 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 518 transitions. [2025-03-03 20:44:19,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-03 20:44:19,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:44:19,225 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, 1, 1] [2025-03-03 20:44:19,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:44:19,226 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:44:19,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:44:19,227 INFO L85 PathProgramCache]: Analyzing trace with hash 2025885578, now seen corresponding path program 1 times [2025-03-03 20:44:19,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:44:19,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686042935] [2025-03-03 20:44:19,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:44:19,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:44:19,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-03 20:44:19,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-03 20:44:19,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:44:19,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:44:20,835 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-03 20:44:20,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:44:20,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686042935] [2025-03-03 20:44:20,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686042935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:44:20,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:44:20,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 20:44:20,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546829764] [2025-03-03 20:44:20,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:44:20,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 20:44:20,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:44:20,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 20:44:20,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-03-03 20:44:20,837 INFO L87 Difference]: Start difference. First operand 328 states and 518 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 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-03 20:44:21,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:44:21,809 INFO L93 Difference]: Finished difference Result 744 states and 1138 transitions. [2025-03-03 20:44:21,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 20:44:21,810 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 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 270 [2025-03-03 20:44:21,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:44:21,814 INFO L225 Difference]: With dead ends: 744 [2025-03-03 20:44:21,814 INFO L226 Difference]: Without dead ends: 742 [2025-03-03 20:44:21,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-03 20:44:21,815 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 526 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 20:44:21,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1268 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 20:44:21,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2025-03-03 20:44:21,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 617. [2025-03-03 20:44:21,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 415 states have (on average 1.4120481927710844) internal successors, (586), 419 states have internal predecessors, (586), 192 states have call successors, (192), 9 states have call predecessors, (192), 9 states have return successors, (192), 188 states have call predecessors, (192), 192 states have call successors, (192) [2025-03-03 20:44:21,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 970 transitions. [2025-03-03 20:44:21,868 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 970 transitions. Word has length 270 [2025-03-03 20:44:21,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:44:21,868 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 970 transitions. [2025-03-03 20:44:21,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 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-03 20:44:21,868 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 970 transitions. [2025-03-03 20:44:21,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-03 20:44:21,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:44:21,870 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, 1, 1] [2025-03-03 20:44:21,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:44:21,870 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:44:21,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:44:21,871 INFO L85 PathProgramCache]: Analyzing trace with hash -2139998999, now seen corresponding path program 1 times [2025-03-03 20:44:21,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:44:21,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248504238] [2025-03-03 20:44:21,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:44:21,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:44:21,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-03 20:44:21,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-03 20:44:21,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:44:21,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:44:24,888 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-03 20:44:24,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:44:24,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248504238] [2025-03-03 20:44:24,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248504238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:44:24,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:44:24,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 20:44:24,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88075934] [2025-03-03 20:44:24,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:44:24,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 20:44:24,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:44:24,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 20:44:24,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-03-03 20:44:24,889 INFO L87 Difference]: Start difference. First operand 617 states and 970 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 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-03 20:44:27,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:44:27,304 INFO L93 Difference]: Finished difference Result 742 states and 1136 transitions. [2025-03-03 20:44:27,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 20:44:27,305 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 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 270 [2025-03-03 20:44:27,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:44:27,309 INFO L225 Difference]: With dead ends: 742 [2025-03-03 20:44:27,309 INFO L226 Difference]: Without dead ends: 740 [2025-03-03 20:44:27,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-03-03 20:44:27,310 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 602 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:44:27,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 1510 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 20:44:27,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2025-03-03 20:44:27,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 617. [2025-03-03 20:44:27,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 415 states have (on average 1.4120481927710844) internal successors, (586), 419 states have internal predecessors, (586), 192 states have call successors, (192), 9 states have call predecessors, (192), 9 states have return successors, (192), 188 states have call predecessors, (192), 192 states have call successors, (192) [2025-03-03 20:44:27,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 970 transitions. [2025-03-03 20:44:27,356 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 970 transitions. Word has length 270 [2025-03-03 20:44:27,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:44:27,356 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 970 transitions. [2025-03-03 20:44:27,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 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-03 20:44:27,357 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 970 transitions. [2025-03-03 20:44:27,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-03 20:44:27,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:44:27,358 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, 1, 1] [2025-03-03 20:44:27,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:44:27,358 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:44:27,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:44:27,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1758547541, now seen corresponding path program 1 times [2025-03-03 20:44:27,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:44:27,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030036474] [2025-03-03 20:44:27,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:44:27,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:44:27,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-03 20:44:27,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-03 20:44:27,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:44:27,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:44:27,447 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-03 20:44:27,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:44:27,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030036474] [2025-03-03 20:44:27,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030036474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:44:27,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:44:27,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:44:27,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827355519] [2025-03-03 20:44:27,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:44:27,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:44:27,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:44:27,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:44:27,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:44:27,450 INFO L87 Difference]: Start difference. First operand 617 states and 970 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-03 20:44:27,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:44:27,682 INFO L93 Difference]: Finished difference Result 1258 states and 1961 transitions. [2025-03-03 20:44:27,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:44:27,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 270 [2025-03-03 20:44:27,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:44:27,687 INFO L225 Difference]: With dead ends: 1258 [2025-03-03 20:44:27,687 INFO L226 Difference]: Without dead ends: 724 [2025-03-03 20:44:27,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:44:27,690 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 141 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:44:27,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 651 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:44:27,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-03-03 20:44:27,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 657. [2025-03-03 20:44:27,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 449 states have (on average 1.4075723830734967) internal successors, (632), 454 states have internal predecessors, (632), 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-03 20:44:27,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1024 transitions. [2025-03-03 20:44:27,733 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1024 transitions. Word has length 270 [2025-03-03 20:44:27,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:44:27,733 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 1024 transitions. [2025-03-03 20:44:27,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-03 20:44:27,733 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1024 transitions. [2025-03-03 20:44:27,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-03 20:44:27,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:44:27,735 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, 1, 1] [2025-03-03 20:44:27,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:44:27,735 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:44:27,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:44:27,735 INFO L85 PathProgramCache]: Analyzing trace with hash 953981415, now seen corresponding path program 1 times [2025-03-03 20:44:27,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:44:27,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489812740] [2025-03-03 20:44:27,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:44:27,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:44:27,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-03 20:44:27,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-03 20:44:27,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:44:27,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:44:27,981 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-03 20:44:27,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:44:27,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489812740] [2025-03-03 20:44:27,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489812740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:44:27,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:44:27,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:44:27,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326782145] [2025-03-03 20:44:27,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:44:27,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:44:27,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:44:27,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:44:27,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:44:27,983 INFO L87 Difference]: Start difference. First operand 657 states and 1024 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-03 20:44:28,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:44:28,260 INFO L93 Difference]: Finished difference Result 1235 states and 1915 transitions. [2025-03-03 20:44:28,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:44:28,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 270 [2025-03-03 20:44:28,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:44:28,265 INFO L225 Difference]: With dead ends: 1235 [2025-03-03 20:44:28,265 INFO L226 Difference]: Without dead ends: 664 [2025-03-03 20:44:28,268 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-03 20:44:28,270 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 223 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 332 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-03 20:44:28,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 332 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:44:28,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-03-03 20:44:28,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 655. [2025-03-03 20:44:28,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 441 states have (on average 1.3854875283446713) internal successors, (611), 446 states have internal predecessors, (611), 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-03 20:44:28,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1011 transitions. [2025-03-03 20:44:28,319 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1011 transitions. Word has length 270 [2025-03-03 20:44:28,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:44:28,320 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 1011 transitions. [2025-03-03 20:44:28,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-03 20:44:28,320 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1011 transitions. [2025-03-03 20:44:28,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-03 20:44:28,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:44:28,322 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, 1, 1, 1] [2025-03-03 20:44:28,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:44:28,323 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:44:28,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:44:28,323 INFO L85 PathProgramCache]: Analyzing trace with hash -300630463, now seen corresponding path program 1 times [2025-03-03 20:44:28,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:44:28,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104354512] [2025-03-03 20:44:28,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:44:28,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:44:28,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-03 20:44:28,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-03 20:44:28,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:44:28,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 20:44:28,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1160272126] [2025-03-03 20:44:28,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:44:28,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:44:28,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:44:28,385 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-03 20:44:28,386 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-03 20:44:28,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-03 20:44:28,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-03 20:44:28,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:44:28,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:44:28,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-03 20:44:28,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:44:32,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1125 proven. 534 refuted. 0 times theorem prover too weak. 2125 trivial. 0 not checked. [2025-03-03 20:44:32,591 INFO L312 TraceCheckSpWp]: Computing backward predicates...