./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-63.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 ac9315a2690c53799e4a492753ac2b98281ab80b3a768a5d84279facf8e19983 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:26:26,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:26:26,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:26:26,758 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:26:26,761 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:26:26,782 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:26:26,783 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:26:26,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:26:26,784 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:26:26,784 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:26:26,785 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:26:26,785 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:26:26,785 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:26:26,785 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:26:26,786 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:26:26,786 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:26:26,786 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:26:26,786 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:26:26,786 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:26:26,786 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:26:26,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:26:26,787 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:26:26,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:26:26,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:26:26,787 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:26:26,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:26:26,787 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:26:26,787 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:26:26,787 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:26:26,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:26:26,787 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:26:26,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:26:26,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:26:26,788 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:26:26,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:26:26,788 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:26:26,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:26:26,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:26:26,788 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:26:26,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:26:26,788 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:26:26,788 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:26:26,789 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:26:26,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:26:26,789 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:26:26,789 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:26:26,789 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:26:26,789 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:26:26,789 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-jdk21/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 -> ac9315a2690c53799e4a492753ac2b98281ab80b3a768a5d84279facf8e19983 [2025-01-09 14:26:27,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:26:27,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:26:27,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:26:27,019 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:26:27,019 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:26:27,020 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-63.i [2025-01-09 14:26:28,227 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bbd8d8062/6daaae041f624cf887c5f26c58402ff3/FLAG09a7ea125 [2025-01-09 14:26:28,481 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:26:28,481 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-63.i [2025-01-09 14:26:28,488 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bbd8d8062/6daaae041f624cf887c5f26c58402ff3/FLAG09a7ea125 [2025-01-09 14:26:28,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bbd8d8062/6daaae041f624cf887c5f26c58402ff3 [2025-01-09 14:26:28,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:26:28,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:26:28,501 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:26:28,501 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:26:28,504 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:26:28,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:26:28" (1/1) ... [2025-01-09 14:26:28,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c778d6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:28, skipping insertion in model container [2025-01-09 14:26:28,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:26:28" (1/1) ... [2025-01-09 14:26:28,522 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:26:28,612 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-63.i[916,929] [2025-01-09 14:26:28,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:26:28,706 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:26:28,721 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-63.i[916,929] [2025-01-09 14:26:28,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:26:28,817 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:26:28,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:28 WrapperNode [2025-01-09 14:26:28,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:26:28,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:26:28,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:26:28,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:26:28,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:28" (1/1) ... [2025-01-09 14:26:28,833 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:28" (1/1) ... [2025-01-09 14:26:28,877 INFO L138 Inliner]: procedures = 26, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 579 [2025-01-09 14:26:28,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:26:28,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:26:28,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:26:28,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:26:28,884 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:28" (1/1) ... [2025-01-09 14:26:28,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:28" (1/1) ... [2025-01-09 14:26:28,891 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:28" (1/1) ... [2025-01-09 14:26:28,925 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-01-09 14:26:28,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:28" (1/1) ... [2025-01-09 14:26:28,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:28" (1/1) ... [2025-01-09 14:26:28,943 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:28" (1/1) ... [2025-01-09 14:26:28,948 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:28" (1/1) ... [2025-01-09 14:26:28,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:28" (1/1) ... [2025-01-09 14:26:28,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:28" (1/1) ... [2025-01-09 14:26:28,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:28" (1/1) ... [2025-01-09 14:26:28,980 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:26:28,981 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:26:28,981 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:26:28,981 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:26:28,982 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:28" (1/1) ... [2025-01-09 14:26:28,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:26:28,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:26:29,003 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:26:29,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:26:29,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:26:29,025 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:26:29,025 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:26:29,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:26:29,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:26:29,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:26:29,140 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:26:29,142 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:26:29,805 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2025-01-09 14:26:29,805 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:26:29,816 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:26:29,816 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:26:29,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:26:29 BoogieIcfgContainer [2025-01-09 14:26:29,817 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:26:29,818 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:26:29,818 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:26:29,821 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:26:29,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:26:28" (1/3) ... [2025-01-09 14:26:29,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@315c58d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:26:29, skipping insertion in model container [2025-01-09 14:26:29,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:28" (2/3) ... [2025-01-09 14:26:29,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@315c58d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:26:29, skipping insertion in model container [2025-01-09 14:26:29,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:26:29" (3/3) ... [2025-01-09 14:26:29,823 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-63.i [2025-01-09 14:26:29,833 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:26:29,835 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-63.i that has 2 procedures, 235 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:26:29,872 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:26:29,880 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;@4c299808, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:26:29,880 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:26:29,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 235 states, 185 states have (on average 1.4972972972972973) internal successors, (277), 186 states have internal predecessors, (277), 47 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-01-09 14:26:29,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-01-09 14:26:29,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:29,898 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:29,899 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:29,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:29,903 INFO L85 PathProgramCache]: Analyzing trace with hash 701836084, now seen corresponding path program 1 times [2025-01-09 14:26:29,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:29,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452087987] [2025-01-09 14:26:29,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:29,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:30,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-01-09 14:26:30,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-01-09 14:26:30,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:30,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:30,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 4232 trivial. 0 not checked. [2025-01-09 14:26:30,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:30,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452087987] [2025-01-09 14:26:30,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452087987] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:26:30,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977572605] [2025-01-09 14:26:30,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:30,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:30,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:26:30,283 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:26:30,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 14:26:30,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-01-09 14:26:30,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-01-09 14:26:30,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:30,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:30,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:26:30,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:26:30,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 4232 trivial. 0 not checked. [2025-01-09 14:26:30,531 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:26:30,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977572605] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:30,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:26:30,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:26:30,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317161707] [2025-01-09 14:26:30,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:30,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:26:30,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:30,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:26:30,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:26:30,553 INFO L87 Difference]: Start difference. First operand has 235 states, 185 states have (on average 1.4972972972972973) internal successors, (277), 186 states have internal predecessors, (277), 47 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) Second operand has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (47), 2 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 2 states have call successors, (47) [2025-01-09 14:26:30,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:30,580 INFO L93 Difference]: Finished difference Result 463 states and 782 transitions. [2025-01-09 14:26:30,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:26:30,581 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (47), 2 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 2 states have call successors, (47) Word has length 325 [2025-01-09 14:26:30,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:30,586 INFO L225 Difference]: With dead ends: 463 [2025-01-09 14:26:30,586 INFO L226 Difference]: Without dead ends: 231 [2025-01-09 14:26:30,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 326 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-01-09 14:26:30,590 INFO L435 NwaCegarLoop]: 360 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, 360 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-01-09 14:26:30,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:26:30,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-01-09 14:26:30,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2025-01-09 14:26:30,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 182 states have (on average 1.4615384615384615) internal successors, (266), 182 states have internal predecessors, (266), 47 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-01-09 14:26:30,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 360 transitions. [2025-01-09 14:26:30,650 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 360 transitions. Word has length 325 [2025-01-09 14:26:30,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:30,652 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 360 transitions. [2025-01-09 14:26:30,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (47), 2 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 2 states have call successors, (47) [2025-01-09 14:26:30,653 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 360 transitions. [2025-01-09 14:26:30,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-01-09 14:26:30,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:30,659 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:30,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:26:30,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:26:30,860 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:30,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:30,861 INFO L85 PathProgramCache]: Analyzing trace with hash 577080822, now seen corresponding path program 1 times [2025-01-09 14:26:30,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:30,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837884508] [2025-01-09 14:26:30,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:30,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:30,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-01-09 14:26:30,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-01-09 14:26:30,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:30,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:31,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-01-09 14:26:31,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:31,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837884508] [2025-01-09 14:26:31,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837884508] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:31,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:31,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:26:31,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440790235] [2025-01-09 14:26:31,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:31,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:26:31,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:31,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:26:31,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:26:31,101 INFO L87 Difference]: Start difference. First operand 231 states and 360 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:26:31,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:31,165 INFO L93 Difference]: Finished difference Result 687 states and 1074 transitions. [2025-01-09 14:26:31,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:26:31,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 325 [2025-01-09 14:26:31,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:31,172 INFO L225 Difference]: With dead ends: 687 [2025-01-09 14:26:31,172 INFO L226 Difference]: Without dead ends: 459 [2025-01-09 14:26:31,173 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-01-09 14:26:31,173 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 342 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:31,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 704 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:26:31,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-01-09 14:26:31,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2025-01-09 14:26:31,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 360 states have (on average 1.4583333333333333) internal successors, (525), 360 states have internal predecessors, (525), 94 states have call successors, (94), 2 states have call predecessors, (94), 2 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) [2025-01-09 14:26:31,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 713 transitions. [2025-01-09 14:26:31,259 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 713 transitions. Word has length 325 [2025-01-09 14:26:31,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:31,261 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 713 transitions. [2025-01-09 14:26:31,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:26:31,261 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 713 transitions. [2025-01-09 14:26:31,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-01-09 14:26:31,266 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:31,266 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:31,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:26:31,266 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:31,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:31,267 INFO L85 PathProgramCache]: Analyzing trace with hash -794726476, now seen corresponding path program 1 times [2025-01-09 14:26:31,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:31,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815043110] [2025-01-09 14:26:31,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:31,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:31,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-01-09 14:26:31,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-01-09 14:26:31,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:31,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:31,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-01-09 14:26:31,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:31,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815043110] [2025-01-09 14:26:31,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815043110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:31,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:31,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:26:31,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793940231] [2025-01-09 14:26:31,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:31,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:26:31,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:31,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:26:31,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:26:31,570 INFO L87 Difference]: Start difference. First operand 457 states and 713 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:26:31,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:31,634 INFO L93 Difference]: Finished difference Result 1127 states and 1747 transitions. [2025-01-09 14:26:31,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:26:31,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 325 [2025-01-09 14:26:31,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:31,644 INFO L225 Difference]: With dead ends: 1127 [2025-01-09 14:26:31,645 INFO L226 Difference]: Without dead ends: 673 [2025-01-09 14:26:31,645 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-01-09 14:26:31,646 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 186 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:31,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 761 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:26:31,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-01-09 14:26:31,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 669. [2025-01-09 14:26:31,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 554 states have (on average 1.4548736462093863) internal successors, (806), 556 states have internal predecessors, (806), 110 states have call successors, (110), 4 states have call predecessors, (110), 4 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2025-01-09 14:26:31,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1026 transitions. [2025-01-09 14:26:31,717 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1026 transitions. Word has length 325 [2025-01-09 14:26:31,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:31,719 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 1026 transitions. [2025-01-09 14:26:31,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:26:31,719 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1026 transitions. [2025-01-09 14:26:31,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-01-09 14:26:31,723 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:31,723 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:31,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:26:31,723 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:31,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:31,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1692119754, now seen corresponding path program 1 times [2025-01-09 14:26:31,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:31,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473006780] [2025-01-09 14:26:31,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:31,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:31,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-01-09 14:26:31,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-01-09 14:26:31,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:31,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:32,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-01-09 14:26:32,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:32,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473006780] [2025-01-09 14:26:32,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473006780] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:32,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:32,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:26:32,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332201053] [2025-01-09 14:26:32,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:32,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:26:32,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:32,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:26:32,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:26:32,363 INFO L87 Difference]: Start difference. First operand 669 states and 1026 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:26:32,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:32,555 INFO L93 Difference]: Finished difference Result 2211 states and 3357 transitions. [2025-01-09 14:26:32,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:26:32,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 325 [2025-01-09 14:26:32,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:32,570 INFO L225 Difference]: With dead ends: 2211 [2025-01-09 14:26:32,570 INFO L226 Difference]: Without dead ends: 1545 [2025-01-09 14:26:32,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:26:32,574 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 362 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:32,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 1126 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:26:32,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2025-01-09 14:26:32,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1171. [2025-01-09 14:26:32,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 1028 states have (on average 1.4669260700389104) internal successors, (1508), 1034 states have internal predecessors, (1508), 134 states have call successors, (134), 8 states have call predecessors, (134), 8 states have return successors, (134), 128 states have call predecessors, (134), 134 states have call successors, (134) [2025-01-09 14:26:32,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1776 transitions. [2025-01-09 14:26:32,645 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1776 transitions. Word has length 325 [2025-01-09 14:26:32,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:32,648 INFO L471 AbstractCegarLoop]: Abstraction has 1171 states and 1776 transitions. [2025-01-09 14:26:32,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:26:32,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1776 transitions. [2025-01-09 14:26:32,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-01-09 14:26:32,653 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:32,653 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:32,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:26:32,653 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:32,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:32,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1764506312, now seen corresponding path program 1 times [2025-01-09 14:26:32,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:32,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795502187] [2025-01-09 14:26:32,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:32,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:32,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-01-09 14:26:32,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-01-09 14:26:32,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:32,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:33,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-01-09 14:26:33,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:33,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795502187] [2025-01-09 14:26:33,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795502187] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:33,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:33,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:26:33,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348131604] [2025-01-09 14:26:33,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:33,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:26:33,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:33,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:26:33,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:26:33,081 INFO L87 Difference]: Start difference. First operand 1171 states and 1776 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:26:33,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:33,230 INFO L93 Difference]: Finished difference Result 2699 states and 4071 transitions. [2025-01-09 14:26:33,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:26:33,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 325 [2025-01-09 14:26:33,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:33,239 INFO L225 Difference]: With dead ends: 2699 [2025-01-09 14:26:33,239 INFO L226 Difference]: Without dead ends: 1531 [2025-01-09 14:26:33,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:26:33,243 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 281 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:33,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1369 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:26:33,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2025-01-09 14:26:33,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1035. [2025-01-09 14:26:33,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 922 states have (on average 1.4598698481561823) internal successors, (1346), 924 states have internal predecessors, (1346), 106 states have call successors, (106), 6 states have call predecessors, (106), 6 states have return successors, (106), 104 states have call predecessors, (106), 106 states have call successors, (106) [2025-01-09 14:26:33,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1558 transitions. [2025-01-09 14:26:33,291 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1558 transitions. Word has length 325 [2025-01-09 14:26:33,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:33,292 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1558 transitions. [2025-01-09 14:26:33,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:26:33,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1558 transitions. [2025-01-09 14:26:33,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-01-09 14:26:33,297 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:33,297 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:33,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:26:33,297 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:33,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:33,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1542629530, now seen corresponding path program 1 times [2025-01-09 14:26:33,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:33,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821791033] [2025-01-09 14:26:33,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:33,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:33,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-01-09 14:26:33,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-01-09 14:26:33,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:33,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:33,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-01-09 14:26:33,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:33,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821791033] [2025-01-09 14:26:33,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821791033] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:33,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:33,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:26:33,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411809185] [2025-01-09 14:26:33,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:33,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:26:33,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:33,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:26:33,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:26:33,717 INFO L87 Difference]: Start difference. First operand 1035 states and 1558 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:26:33,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:33,968 INFO L93 Difference]: Finished difference Result 3359 states and 5051 transitions. [2025-01-09 14:26:33,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:26:33,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 326 [2025-01-09 14:26:33,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:33,978 INFO L225 Difference]: With dead ends: 3359 [2025-01-09 14:26:33,978 INFO L226 Difference]: Without dead ends: 2327 [2025-01-09 14:26:33,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:26:33,982 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 475 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:33,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 1250 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:26:33,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2327 states. [2025-01-09 14:26:34,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2327 to 2055. [2025-01-09 14:26:34,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2055 states, 1886 states have (on average 1.477200424178155) internal successors, (2786), 1889 states have internal predecessors, (2786), 159 states have call successors, (159), 9 states have call predecessors, (159), 9 states have return successors, (159), 156 states have call predecessors, (159), 159 states have call successors, (159) [2025-01-09 14:26:34,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 3104 transitions. [2025-01-09 14:26:34,078 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 3104 transitions. Word has length 326 [2025-01-09 14:26:34,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:34,079 INFO L471 AbstractCegarLoop]: Abstraction has 2055 states and 3104 transitions. [2025-01-09 14:26:34,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:26:34,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 3104 transitions. [2025-01-09 14:26:34,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-01-09 14:26:34,083 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:34,084 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:34,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:26:34,084 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:34,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:34,085 INFO L85 PathProgramCache]: Analyzing trace with hash 463140454, now seen corresponding path program 1 times [2025-01-09 14:26:34,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:34,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299728488] [2025-01-09 14:26:34,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:34,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:34,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-01-09 14:26:34,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-01-09 14:26:34,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:34,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:34,486 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-01-09 14:26:34,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:34,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299728488] [2025-01-09 14:26:34,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299728488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:34,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:34,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:26:34,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113008174] [2025-01-09 14:26:34,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:34,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:26:34,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:34,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:26:34,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:26:34,488 INFO L87 Difference]: Start difference. First operand 2055 states and 3104 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:26:34,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:34,764 INFO L93 Difference]: Finished difference Result 5433 states and 8174 transitions. [2025-01-09 14:26:34,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:26:34,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 326 [2025-01-09 14:26:34,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:34,776 INFO L225 Difference]: With dead ends: 5433 [2025-01-09 14:26:34,776 INFO L226 Difference]: Without dead ends: 3381 [2025-01-09 14:26:34,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:26:34,780 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 250 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:34,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1034 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:26:34,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3381 states. [2025-01-09 14:26:34,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3381 to 2230. [2025-01-09 14:26:34,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2230 states, 2011 states have (on average 1.4664346096469418) internal successors, (2949), 2014 states have internal predecessors, (2949), 206 states have call successors, (206), 12 states have call predecessors, (206), 12 states have return successors, (206), 203 states have call predecessors, (206), 206 states have call successors, (206) [2025-01-09 14:26:34,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 2230 states and 3361 transitions. [2025-01-09 14:26:34,893 INFO L78 Accepts]: Start accepts. Automaton has 2230 states and 3361 transitions. Word has length 326 [2025-01-09 14:26:34,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:34,893 INFO L471 AbstractCegarLoop]: Abstraction has 2230 states and 3361 transitions. [2025-01-09 14:26:34,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:26:34,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2230 states and 3361 transitions. [2025-01-09 14:26:34,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-01-09 14:26:34,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:34,899 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:34,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:26:34,899 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:34,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:34,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1356626792, now seen corresponding path program 1 times [2025-01-09 14:26:34,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:34,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2701061] [2025-01-09 14:26:34,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:34,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:34,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-01-09 14:26:35,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-01-09 14:26:35,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:35,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-01-09 14:26:35,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:35,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2701061] [2025-01-09 14:26:35,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2701061] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:35,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:35,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:26:35,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72332877] [2025-01-09 14:26:35,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:35,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:26:35,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:35,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:26:35,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:26:35,405 INFO L87 Difference]: Start difference. First operand 2230 states and 3361 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:26:35,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:35,635 INFO L93 Difference]: Finished difference Result 4967 states and 7444 transitions. [2025-01-09 14:26:35,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:26:35,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 326 [2025-01-09 14:26:35,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:35,644 INFO L225 Difference]: With dead ends: 4967 [2025-01-09 14:26:35,644 INFO L226 Difference]: Without dead ends: 2915 [2025-01-09 14:26:35,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:26:35,647 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 590 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1450 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:35,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 1450 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:26:35,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2025-01-09 14:26:35,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 2225. [2025-01-09 14:26:35,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2225 states, 2006 states have (on average 1.4576271186440677) internal successors, (2924), 2009 states have internal predecessors, (2924), 206 states have call successors, (206), 12 states have call predecessors, (206), 12 states have return successors, (206), 203 states have call predecessors, (206), 206 states have call successors, (206) [2025-01-09 14:26:35,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 2225 states and 3336 transitions. [2025-01-09 14:26:35,713 INFO L78 Accepts]: Start accepts. Automaton has 2225 states and 3336 transitions. Word has length 326 [2025-01-09 14:26:35,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:35,714 INFO L471 AbstractCegarLoop]: Abstraction has 2225 states and 3336 transitions. [2025-01-09 14:26:35,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:26:35,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 3336 transitions. [2025-01-09 14:26:35,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-01-09 14:26:35,718 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:35,718 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:35,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:26:35,718 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:35,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:35,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1680446945, now seen corresponding path program 1 times [2025-01-09 14:26:35,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:35,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783807762] [2025-01-09 14:26:35,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:35,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:35,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-01-09 14:26:35,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-01-09 14:26:35,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:35,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:39,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-01-09 14:26:39,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:39,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783807762] [2025-01-09 14:26:39,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783807762] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:39,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:39,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:26:39,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456989644] [2025-01-09 14:26:39,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:39,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:26:39,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:39,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:26:39,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:26:39,737 INFO L87 Difference]: Start difference. First operand 2225 states and 3336 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:26:40,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:40,888 INFO L93 Difference]: Finished difference Result 4636 states and 6895 transitions. [2025-01-09 14:26:40,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:26:40,889 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 326 [2025-01-09 14:26:40,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:40,897 INFO L225 Difference]: With dead ends: 4636 [2025-01-09 14:26:40,897 INFO L226 Difference]: Without dead ends: 2589 [2025-01-09 14:26:40,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:26:40,901 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 894 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 1721 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:40,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 1721 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 14:26:40,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2025-01-09 14:26:40,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2249. [2025-01-09 14:26:40,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2249 states, 2024 states have (on average 1.451086956521739) internal successors, (2937), 2027 states have internal predecessors, (2937), 206 states have call successors, (206), 18 states have call predecessors, (206), 18 states have return successors, (206), 203 states have call predecessors, (206), 206 states have call successors, (206) [2025-01-09 14:26:40,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2249 states to 2249 states and 3349 transitions. [2025-01-09 14:26:40,960 INFO L78 Accepts]: Start accepts. Automaton has 2249 states and 3349 transitions. Word has length 326 [2025-01-09 14:26:40,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:40,960 INFO L471 AbstractCegarLoop]: Abstraction has 2249 states and 3349 transitions. [2025-01-09 14:26:40,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:26:40,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2249 states and 3349 transitions. [2025-01-09 14:26:40,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-01-09 14:26:40,964 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:40,965 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:40,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:26:40,965 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:40,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:40,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1879663333, now seen corresponding path program 1 times [2025-01-09 14:26:40,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:40,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772589488] [2025-01-09 14:26:40,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:40,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:40,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-01-09 14:26:41,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-01-09 14:26:41,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:41,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:41,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-01-09 14:26:41,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:41,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772589488] [2025-01-09 14:26:41,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772589488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:41,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:41,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:26:41,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093430162] [2025-01-09 14:26:41,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:41,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:26:41,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:41,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:26:41,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:26:41,327 INFO L87 Difference]: Start difference. First operand 2249 states and 3349 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:26:41,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:41,461 INFO L93 Difference]: Finished difference Result 5250 states and 7751 transitions. [2025-01-09 14:26:41,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:26:41,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 327 [2025-01-09 14:26:41,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:41,472 INFO L225 Difference]: With dead ends: 5250 [2025-01-09 14:26:41,472 INFO L226 Difference]: Without dead ends: 3154 [2025-01-09 14:26:41,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:26:41,476 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 363 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:41,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1145 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:26:41,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3154 states. [2025-01-09 14:26:41,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3154 to 2259. [2025-01-09 14:26:41,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2259 states, 2034 states have (on average 1.4513274336283186) internal successors, (2952), 2037 states have internal predecessors, (2952), 206 states have call successors, (206), 18 states have call predecessors, (206), 18 states have return successors, (206), 203 states have call predecessors, (206), 206 states have call successors, (206) [2025-01-09 14:26:41,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 2259 states and 3364 transitions. [2025-01-09 14:26:41,543 INFO L78 Accepts]: Start accepts. Automaton has 2259 states and 3364 transitions. Word has length 327 [2025-01-09 14:26:41,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:41,544 INFO L471 AbstractCegarLoop]: Abstraction has 2259 states and 3364 transitions. [2025-01-09 14:26:41,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:26:41,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 3364 transitions. [2025-01-09 14:26:41,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-01-09 14:26:41,546 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:41,546 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:41,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:26:41,547 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:41,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:41,547 INFO L85 PathProgramCache]: Analyzing trace with hash -474508905, now seen corresponding path program 1 times [2025-01-09 14:26:41,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:41,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101122935] [2025-01-09 14:26:41,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:41,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:41,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-01-09 14:26:41,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-01-09 14:26:41,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:41,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:44,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-01-09 14:26:44,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:44,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101122935] [2025-01-09 14:26:44,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101122935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:44,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:44,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:26:44,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334737861] [2025-01-09 14:26:44,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:44,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:26:44,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:44,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:26:44,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:26:44,879 INFO L87 Difference]: Start difference. First operand 2259 states and 3364 transitions. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:26:47,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:47,134 INFO L93 Difference]: Finished difference Result 6544 states and 9665 transitions. [2025-01-09 14:26:47,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 14:26:47,135 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 327 [2025-01-09 14:26:47,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:47,147 INFO L225 Difference]: With dead ends: 6544 [2025-01-09 14:26:47,147 INFO L226 Difference]: Without dead ends: 4463 [2025-01-09 14:26:47,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2025-01-09 14:26:47,151 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 1326 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 2147 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:47,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 2147 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 14:26:47,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4463 states. [2025-01-09 14:26:47,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4463 to 2631. [2025-01-09 14:26:47,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2631 states, 2406 states have (on average 1.470906068162926) internal successors, (3539), 2409 states have internal predecessors, (3539), 206 states have call successors, (206), 18 states have call predecessors, (206), 18 states have return successors, (206), 203 states have call predecessors, (206), 206 states have call successors, (206) [2025-01-09 14:26:47,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 3951 transitions. [2025-01-09 14:26:47,223 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 3951 transitions. Word has length 327 [2025-01-09 14:26:47,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:47,224 INFO L471 AbstractCegarLoop]: Abstraction has 2631 states and 3951 transitions. [2025-01-09 14:26:47,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:26:47,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 3951 transitions. [2025-01-09 14:26:47,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-01-09 14:26:47,227 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:47,227 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:47,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:26:47,228 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:47,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:47,229 INFO L85 PathProgramCache]: Analyzing trace with hash 572518342, now seen corresponding path program 1 times [2025-01-09 14:26:47,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:47,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170806500] [2025-01-09 14:26:47,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:47,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:47,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-01-09 14:26:47,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-01-09 14:26:47,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:47,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:47,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-01-09 14:26:47,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:47,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170806500] [2025-01-09 14:26:47,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170806500] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:47,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:47,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:26:47,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789273471] [2025-01-09 14:26:47,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:47,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:26:47,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:47,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:26:47,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:26:47,481 INFO L87 Difference]: Start difference. First operand 2631 states and 3951 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:26:47,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:47,726 INFO L93 Difference]: Finished difference Result 5347 states and 8025 transitions. [2025-01-09 14:26:47,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:26:47,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 327 [2025-01-09 14:26:47,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:47,750 INFO L225 Difference]: With dead ends: 5347 [2025-01-09 14:26:47,752 INFO L226 Difference]: Without dead ends: 3689 [2025-01-09 14:26:47,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:26:47,756 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 451 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:47,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 1193 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:26:47,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2025-01-09 14:26:47,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 2943. [2025-01-09 14:26:47,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2943 states, 2718 states have (on average 1.4919058130978662) internal successors, (4055), 2721 states have internal predecessors, (4055), 206 states have call successors, (206), 18 states have call predecessors, (206), 18 states have return successors, (206), 203 states have call predecessors, (206), 206 states have call successors, (206) [2025-01-09 14:26:47,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2943 states to 2943 states and 4467 transitions. [2025-01-09 14:26:47,834 INFO L78 Accepts]: Start accepts. Automaton has 2943 states and 4467 transitions. Word has length 327 [2025-01-09 14:26:47,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:47,835 INFO L471 AbstractCegarLoop]: Abstraction has 2943 states and 4467 transitions. [2025-01-09 14:26:47,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:26:47,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2943 states and 4467 transitions. [2025-01-09 14:26:47,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-01-09 14:26:47,837 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:47,837 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:47,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:26:47,838 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:47,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:47,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1068306634, now seen corresponding path program 1 times [2025-01-09 14:26:47,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:47,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624882665] [2025-01-09 14:26:47,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:47,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:47,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-01-09 14:26:47,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-01-09 14:26:47,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:47,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:48,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-01-09 14:26:48,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:48,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624882665] [2025-01-09 14:26:48,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624882665] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:48,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:48,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:26:48,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139821706] [2025-01-09 14:26:48,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:48,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:26:48,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:48,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:26:48,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:26:48,361 INFO L87 Difference]: Start difference. First operand 2943 states and 4467 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 2 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 2 states have call successors, (47) [2025-01-09 14:26:48,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:48,784 INFO L93 Difference]: Finished difference Result 9714 states and 14656 transitions. [2025-01-09 14:26:48,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:26:48,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 2 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 2 states have call successors, (47) Word has length 327 [2025-01-09 14:26:48,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:48,798 INFO L225 Difference]: With dead ends: 9714 [2025-01-09 14:26:48,801 INFO L226 Difference]: Without dead ends: 7000 [2025-01-09 14:26:48,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:26:48,807 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 787 mSDsluCounter, 1926 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 2451 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:48,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 2451 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:26:48,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7000 states. [2025-01-09 14:26:48,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7000 to 5544. [2025-01-09 14:26:48,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5544 states, 5319 states have (on average 1.5147584132355707) internal successors, (8057), 5322 states have internal predecessors, (8057), 206 states have call successors, (206), 18 states have call predecessors, (206), 18 states have return successors, (206), 203 states have call predecessors, (206), 206 states have call successors, (206) [2025-01-09 14:26:48,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 8469 transitions. [2025-01-09 14:26:48,933 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 8469 transitions. Word has length 327 [2025-01-09 14:26:48,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:48,934 INFO L471 AbstractCegarLoop]: Abstraction has 5544 states and 8469 transitions. [2025-01-09 14:26:48,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 2 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 2 states have call successors, (47) [2025-01-09 14:26:48,934 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 8469 transitions. [2025-01-09 14:26:48,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-01-09 14:26:48,938 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:48,938 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:48,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:26:48,938 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:48,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:48,939 INFO L85 PathProgramCache]: Analyzing trace with hash -2143855206, now seen corresponding path program 1 times [2025-01-09 14:26:48,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:48,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401246426] [2025-01-09 14:26:48,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:48,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:48,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-01-09 14:26:49,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-01-09 14:26:49,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:49,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:50,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-01-09 14:26:50,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:50,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401246426] [2025-01-09 14:26:50,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401246426] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:50,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:50,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 14:26:50,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356763552] [2025-01-09 14:26:50,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:50,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:26:50,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:50,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:26:50,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:26:50,023 INFO L87 Difference]: Start difference. First operand 5544 states and 8469 transitions. Second operand has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:26:50,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:50,845 INFO L93 Difference]: Finished difference Result 16298 states and 24655 transitions. [2025-01-09 14:26:50,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 14:26:50,846 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 328 [2025-01-09 14:26:50,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:50,867 INFO L225 Difference]: With dead ends: 16298 [2025-01-09 14:26:50,867 INFO L226 Difference]: Without dead ends: 11856 [2025-01-09 14:26:50,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:26:50,874 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 1178 mSDsluCounter, 1468 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:50,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1178 Valid, 1872 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:26:50,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11856 states. [2025-01-09 14:26:50,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11856 to 6204. [2025-01-09 14:26:50,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6204 states, 5961 states have (on average 1.4967287367891293) internal successors, (8922), 5967 states have internal predecessors, (8922), 218 states have call successors, (218), 24 states have call predecessors, (218), 24 states have return successors, (218), 212 states have call predecessors, (218), 218 states have call successors, (218) [2025-01-09 14:26:51,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6204 states to 6204 states and 9358 transitions. [2025-01-09 14:26:51,002 INFO L78 Accepts]: Start accepts. Automaton has 6204 states and 9358 transitions. Word has length 328 [2025-01-09 14:26:51,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:51,003 INFO L471 AbstractCegarLoop]: Abstraction has 6204 states and 9358 transitions. [2025-01-09 14:26:51,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:26:51,003 INFO L276 IsEmpty]: Start isEmpty. Operand 6204 states and 9358 transitions. [2025-01-09 14:26:51,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-01-09 14:26:51,007 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:51,007 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:51,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:26:51,007 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:51,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:51,008 INFO L85 PathProgramCache]: Analyzing trace with hash -924735342, now seen corresponding path program 1 times [2025-01-09 14:26:51,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:51,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508212595] [2025-01-09 14:26:51,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:51,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:51,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-01-09 14:26:51,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-01-09 14:26:51,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:51,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:51,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-01-09 14:26:51,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:51,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508212595] [2025-01-09 14:26:51,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508212595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:51,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:51,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:26:51,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64922257] [2025-01-09 14:26:51,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:51,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:26:51,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:51,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:26:51,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:26:51,852 INFO L87 Difference]: Start difference. First operand 6204 states and 9358 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 2 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-01-09 14:26:52,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:52,706 INFO L93 Difference]: Finished difference Result 17368 states and 25735 transitions. [2025-01-09 14:26:52,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:26:52,707 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 2 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 328 [2025-01-09 14:26:52,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:52,727 INFO L225 Difference]: With dead ends: 17368 [2025-01-09 14:26:52,727 INFO L226 Difference]: Without dead ends: 12020 [2025-01-09 14:26:52,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:26:52,735 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 1979 mSDsluCounter, 1910 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1979 SdHoareTripleChecker+Valid, 2284 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:52,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1979 Valid, 2284 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:26:52,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12020 states. [2025-01-09 14:26:52,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12020 to 9699. [2025-01-09 14:26:52,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9699 states, 9395 states have (on average 1.4855774348057478) internal successors, (13957), 9407 states have internal predecessors, (13957), 262 states have call successors, (262), 41 states have call predecessors, (262), 41 states have return successors, (262), 250 states have call predecessors, (262), 262 states have call successors, (262) [2025-01-09 14:26:52,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9699 states to 9699 states and 14481 transitions. [2025-01-09 14:26:52,937 INFO L78 Accepts]: Start accepts. Automaton has 9699 states and 14481 transitions. Word has length 328 [2025-01-09 14:26:52,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:52,937 INFO L471 AbstractCegarLoop]: Abstraction has 9699 states and 14481 transitions. [2025-01-09 14:26:52,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 2 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-01-09 14:26:52,938 INFO L276 IsEmpty]: Start isEmpty. Operand 9699 states and 14481 transitions. [2025-01-09 14:26:52,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-01-09 14:26:52,946 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:52,946 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:52,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:26:52,946 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:52,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:52,947 INFO L85 PathProgramCache]: Analyzing trace with hash -31249004, now seen corresponding path program 1 times [2025-01-09 14:26:52,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:52,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060781115] [2025-01-09 14:26:52,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:52,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:53,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-01-09 14:26:53,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-01-09 14:26:53,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:53,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:54,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-01-09 14:26:54,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:54,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060781115] [2025-01-09 14:26:54,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060781115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:54,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:54,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 14:26:54,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035820611] [2025-01-09 14:26:54,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:54,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 14:26:54,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:54,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 14:26:54,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2025-01-09 14:26:54,331 INFO L87 Difference]: Start difference. First operand 9699 states and 14481 transitions. Second operand has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 3 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2025-01-09 14:26:57,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:57,325 INFO L93 Difference]: Finished difference Result 22869 states and 33789 transitions. [2025-01-09 14:26:57,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 14:26:57,325 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 3 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) Word has length 328 [2025-01-09 14:26:57,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:57,353 INFO L225 Difference]: With dead ends: 22869 [2025-01-09 14:26:57,353 INFO L226 Difference]: Without dead ends: 17761 [2025-01-09 14:26:57,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=191, Invalid=801, Unknown=0, NotChecked=0, Total=992 [2025-01-09 14:26:57,363 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 2200 mSDsluCounter, 4739 mSDsCounter, 0 mSdLazyCounter, 3070 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2200 SdHoareTripleChecker+Valid, 5300 SdHoareTripleChecker+Invalid, 3373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 3070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:57,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2200 Valid, 5300 Invalid, 3373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 3070 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 14:26:57,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17761 states. [2025-01-09 14:26:57,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17761 to 10382. [2025-01-09 14:26:57,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10382 states, 10070 states have (on average 1.4856007944389276) internal successors, (14960), 10083 states have internal predecessors, (14960), 266 states have call successors, (266), 45 states have call predecessors, (266), 45 states have return successors, (266), 253 states have call predecessors, (266), 266 states have call successors, (266) [2025-01-09 14:26:57,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10382 states to 10382 states and 15492 transitions. [2025-01-09 14:26:57,602 INFO L78 Accepts]: Start accepts. Automaton has 10382 states and 15492 transitions. Word has length 328 [2025-01-09 14:26:57,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:57,602 INFO L471 AbstractCegarLoop]: Abstraction has 10382 states and 15492 transitions. [2025-01-09 14:26:57,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 3 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2025-01-09 14:26:57,603 INFO L276 IsEmpty]: Start isEmpty. Operand 10382 states and 15492 transitions. [2025-01-09 14:26:57,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-01-09 14:26:57,613 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:57,613 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:26:57,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 14:26:57,614 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:57,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:57,614 INFO L85 PathProgramCache]: Analyzing trace with hash -512329262, now seen corresponding path program 1 times [2025-01-09 14:26:57,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:57,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974120005] [2025-01-09 14:26:57,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:57,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:57,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-01-09 14:26:57,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-01-09 14:26:57,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:57,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:01,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-01-09 14:27:01,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:01,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974120005] [2025-01-09 14:27:01,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974120005] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:01,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:01,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 14:27:01,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496708003] [2025-01-09 14:27:01,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:01,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 14:27:01,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:01,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 14:27:01,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:27:01,220 INFO L87 Difference]: Start difference. First operand 10382 states and 15492 transitions. Second operand has 12 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:27:03,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:03,460 INFO L93 Difference]: Finished difference Result 18609 states and 27477 transitions. [2025-01-09 14:27:03,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 14:27:03,461 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 328 [2025-01-09 14:27:03,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:03,482 INFO L225 Difference]: With dead ends: 18609 [2025-01-09 14:27:03,482 INFO L226 Difference]: Without dead ends: 12287 [2025-01-09 14:27:03,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-01-09 14:27:03,492 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 1275 mSDsluCounter, 2521 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1275 SdHoareTripleChecker+Valid, 2955 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:03,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1275 Valid, 2955 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 14:27:03,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12287 states. [2025-01-09 14:27:03,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12287 to 10135. [2025-01-09 14:27:03,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10135 states, 9828 states have (on average 1.4764957264957266) internal successors, (14511), 9840 states have internal predecessors, (14511), 262 states have call successors, (262), 44 states have call predecessors, (262), 44 states have return successors, (262), 250 states have call predecessors, (262), 262 states have call successors, (262) [2025-01-09 14:27:03,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10135 states to 10135 states and 15035 transitions. [2025-01-09 14:27:03,666 INFO L78 Accepts]: Start accepts. Automaton has 10135 states and 15035 transitions. Word has length 328 [2025-01-09 14:27:03,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:03,667 INFO L471 AbstractCegarLoop]: Abstraction has 10135 states and 15035 transitions. [2025-01-09 14:27:03,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 12 states have internal predecessors, (96), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:27:03,667 INFO L276 IsEmpty]: Start isEmpty. Operand 10135 states and 15035 transitions. [2025-01-09 14:27:03,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-01-09 14:27:03,674 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:03,674 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:27:03,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 14:27:03,674 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:03,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:03,675 INFO L85 PathProgramCache]: Analyzing trace with hash 771450762, now seen corresponding path program 1 times [2025-01-09 14:27:03,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:03,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030832670] [2025-01-09 14:27:03,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:03,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:03,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-01-09 14:27:03,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-01-09 14:27:03,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:03,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:09,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-01-09 14:27:09,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:09,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030832670] [2025-01-09 14:27:09,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030832670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:09,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:09,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 14:27:09,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805386187] [2025-01-09 14:27:09,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:09,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 14:27:09,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:09,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 14:27:09,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2025-01-09 14:27:09,777 INFO L87 Difference]: Start difference. First operand 10135 states and 15035 transitions. Second operand has 19 states, 19 states have (on average 5.105263157894737) internal successors, (97), 19 states have internal predecessors, (97), 4 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 4 states have call predecessors, (47), 4 states have call successors, (47) [2025-01-09 14:27:14,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:14,195 INFO L93 Difference]: Finished difference Result 21272 states and 31111 transitions. [2025-01-09 14:27:14,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 14:27:14,196 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.105263157894737) internal successors, (97), 19 states have internal predecessors, (97), 4 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 4 states have call predecessors, (47), 4 states have call successors, (47) Word has length 329 [2025-01-09 14:27:14,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:14,217 INFO L225 Difference]: With dead ends: 21272 [2025-01-09 14:27:14,217 INFO L226 Difference]: Without dead ends: 15261 [2025-01-09 14:27:14,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=202, Invalid=728, Unknown=0, NotChecked=0, Total=930 [2025-01-09 14:27:14,228 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 3169 mSDsluCounter, 3321 mSDsCounter, 0 mSdLazyCounter, 3100 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3169 SdHoareTripleChecker+Valid, 3718 SdHoareTripleChecker+Invalid, 3388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 3100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:14,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3169 Valid, 3718 Invalid, 3388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 3100 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-09 14:27:14,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15261 states. [2025-01-09 14:27:14,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15261 to 10181. [2025-01-09 14:27:14,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10181 states, 9874 states have (on average 1.4765039497670651) internal successors, (14579), 9886 states have internal predecessors, (14579), 262 states have call successors, (262), 44 states have call predecessors, (262), 44 states have return successors, (262), 250 states have call predecessors, (262), 262 states have call successors, (262) [2025-01-09 14:27:14,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10181 states to 10181 states and 15103 transitions. [2025-01-09 14:27:14,450 INFO L78 Accepts]: Start accepts. Automaton has 10181 states and 15103 transitions. Word has length 329 [2025-01-09 14:27:14,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:14,450 INFO L471 AbstractCegarLoop]: Abstraction has 10181 states and 15103 transitions. [2025-01-09 14:27:14,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.105263157894737) internal successors, (97), 19 states have internal predecessors, (97), 4 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 4 states have call predecessors, (47), 4 states have call successors, (47) [2025-01-09 14:27:14,451 INFO L276 IsEmpty]: Start isEmpty. Operand 10181 states and 15103 transitions. [2025-01-09 14:27:14,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-01-09 14:27:14,457 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:14,458 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:27:14,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 14:27:14,458 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:14,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:14,458 INFO L85 PathProgramCache]: Analyzing trace with hash 2029344321, now seen corresponding path program 1 times [2025-01-09 14:27:14,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:14,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032945762] [2025-01-09 14:27:14,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:14,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:14,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-01-09 14:27:14,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-01-09 14:27:14,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:14,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:17,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-01-09 14:27:17,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:17,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032945762] [2025-01-09 14:27:17,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032945762] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:17,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:17,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 14:27:17,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423322852] [2025-01-09 14:27:17,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:17,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 14:27:17,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:17,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 14:27:17,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:27:17,717 INFO L87 Difference]: Start difference. First operand 10181 states and 15103 transitions. Second operand has 13 states, 13 states have (on average 7.461538461538462) internal successors, (97), 13 states have internal predecessors, (97), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:27:21,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:21,396 INFO L93 Difference]: Finished difference Result 22412 states and 33201 transitions. [2025-01-09 14:27:21,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 14:27:21,397 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.461538461538462) internal successors, (97), 13 states have internal predecessors, (97), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 329 [2025-01-09 14:27:21,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:21,423 INFO L225 Difference]: With dead ends: 22412 [2025-01-09 14:27:21,423 INFO L226 Difference]: Without dead ends: 16015 [2025-01-09 14:27:21,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2025-01-09 14:27:21,433 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 1378 mSDsluCounter, 2520 mSDsCounter, 0 mSdLazyCounter, 2272 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 3009 SdHoareTripleChecker+Invalid, 2431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 2272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:21,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 3009 Invalid, 2431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 2272 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-09 14:27:21,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16015 states. [2025-01-09 14:27:21,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16015 to 13175. [2025-01-09 14:27:21,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13175 states, 12671 states have (on average 1.4762055086417805) internal successors, (18705), 12688 states have internal predecessors, (18705), 437 states have call successors, (437), 66 states have call predecessors, (437), 66 states have return successors, (437), 420 states have call predecessors, (437), 437 states have call successors, (437) [2025-01-09 14:27:21,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13175 states to 13175 states and 19579 transitions. [2025-01-09 14:27:21,689 INFO L78 Accepts]: Start accepts. Automaton has 13175 states and 19579 transitions. Word has length 329 [2025-01-09 14:27:21,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:21,690 INFO L471 AbstractCegarLoop]: Abstraction has 13175 states and 19579 transitions. [2025-01-09 14:27:21,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.461538461538462) internal successors, (97), 13 states have internal predecessors, (97), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:27:21,690 INFO L276 IsEmpty]: Start isEmpty. Operand 13175 states and 19579 transitions. [2025-01-09 14:27:21,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-01-09 14:27:21,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:21,697 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:27:21,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 14:27:21,698 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:21,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:21,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1257135348, now seen corresponding path program 1 times [2025-01-09 14:27:21,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:21,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114730729] [2025-01-09 14:27:21,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:21,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:21,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-01-09 14:27:21,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-01-09 14:27:21,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:21,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:25,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-01-09 14:27:25,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:25,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114730729] [2025-01-09 14:27:25,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114730729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:25,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:25,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 14:27:25,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242443946] [2025-01-09 14:27:25,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:25,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:27:25,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:25,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:27:25,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:27:25,417 INFO L87 Difference]: Start difference. First operand 13175 states and 19579 transitions. Second operand has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:27:27,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:27,358 INFO L93 Difference]: Finished difference Result 35089 states and 52296 transitions. [2025-01-09 14:27:27,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 14:27:27,358 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 329 [2025-01-09 14:27:27,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:27,400 INFO L225 Difference]: With dead ends: 35089 [2025-01-09 14:27:27,401 INFO L226 Difference]: Without dead ends: 29223 [2025-01-09 14:27:27,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=181, Invalid=419, Unknown=0, NotChecked=0, Total=600 [2025-01-09 14:27:27,419 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 2398 mSDsluCounter, 2057 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2398 SdHoareTripleChecker+Valid, 2366 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:27,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2398 Valid, 2366 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 14:27:27,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29223 states. [2025-01-09 14:27:27,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29223 to 17776. [2025-01-09 14:27:27,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17776 states, 17055 states have (on average 1.4759894459102902) internal successors, (25173), 17079 states have internal predecessors, (25173), 624 states have call successors, (624), 96 states have call predecessors, (624), 96 states have return successors, (624), 600 states have call predecessors, (624), 624 states have call successors, (624) [2025-01-09 14:27:27,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17776 states to 17776 states and 26421 transitions. [2025-01-09 14:27:27,878 INFO L78 Accepts]: Start accepts. Automaton has 17776 states and 26421 transitions. Word has length 329 [2025-01-09 14:27:27,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:27,879 INFO L471 AbstractCegarLoop]: Abstraction has 17776 states and 26421 transitions. [2025-01-09 14:27:27,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:27:27,879 INFO L276 IsEmpty]: Start isEmpty. Operand 17776 states and 26421 transitions. [2025-01-09 14:27:27,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-01-09 14:27:27,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:27,885 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:27:27,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 14:27:27,886 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:27,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:27,886 INFO L85 PathProgramCache]: Analyzing trace with hash -2132069948, now seen corresponding path program 1 times [2025-01-09 14:27:27,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:27,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572763535] [2025-01-09 14:27:27,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:27,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:27,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-01-09 14:27:27,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-01-09 14:27:27,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:27,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:33,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-01-09 14:27:33,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:33,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572763535] [2025-01-09 14:27:33,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572763535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:33,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:33,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 14:27:33,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836540599] [2025-01-09 14:27:33,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:33,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:27:33,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:33,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:27:33,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:27:33,816 INFO L87 Difference]: Start difference. First operand 17776 states and 26421 transitions. Second operand has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 11 states have internal predecessors, (100), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:27:36,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:36,116 INFO L93 Difference]: Finished difference Result 39962 states and 59249 transitions. [2025-01-09 14:27:36,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:27:36,117 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 11 states have internal predecessors, (100), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 332 [2025-01-09 14:27:36,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:36,192 INFO L225 Difference]: With dead ends: 39962 [2025-01-09 14:27:36,195 INFO L226 Difference]: Without dead ends: 25947 [2025-01-09 14:27:36,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:27:36,234 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 581 mSDsluCounter, 3066 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 3580 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:36,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 3580 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1249 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 14:27:36,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25947 states. [2025-01-09 14:27:36,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25947 to 20732. [2025-01-09 14:27:36,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20732 states, 20011 states have (on average 1.4810854030283345) internal successors, (29638), 20035 states have internal predecessors, (29638), 624 states have call successors, (624), 96 states have call predecessors, (624), 96 states have return successors, (624), 600 states have call predecessors, (624), 624 states have call successors, (624) [2025-01-09 14:27:36,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20732 states to 20732 states and 30886 transitions. [2025-01-09 14:27:36,686 INFO L78 Accepts]: Start accepts. Automaton has 20732 states and 30886 transitions. Word has length 332 [2025-01-09 14:27:36,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:36,687 INFO L471 AbstractCegarLoop]: Abstraction has 20732 states and 30886 transitions. [2025-01-09 14:27:36,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 11 states have internal predecessors, (100), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:27:36,687 INFO L276 IsEmpty]: Start isEmpty. Operand 20732 states and 30886 transitions. [2025-01-09 14:27:36,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-01-09 14:27:36,695 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:36,696 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:27:36,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 14:27:36,696 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:36,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:36,697 INFO L85 PathProgramCache]: Analyzing trace with hash -593729918, now seen corresponding path program 1 times [2025-01-09 14:27:36,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:36,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240689597] [2025-01-09 14:27:36,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:36,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:36,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-01-09 14:27:36,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-01-09 14:27:36,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:36,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:44,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-01-09 14:27:44,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:44,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240689597] [2025-01-09 14:27:44,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240689597] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:44,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:44,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 14:27:44,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718574399] [2025-01-09 14:27:44,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:44,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:27:44,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:44,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:27:44,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:27:44,932 INFO L87 Difference]: Start difference. First operand 20732 states and 30886 transitions. Second operand has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 11 states have internal predecessors, (100), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:27:49,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:49,115 INFO L93 Difference]: Finished difference Result 45210 states and 67158 transitions. [2025-01-09 14:27:49,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 14:27:49,116 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 11 states have internal predecessors, (100), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 332 [2025-01-09 14:27:49,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:49,159 INFO L225 Difference]: With dead ends: 45210 [2025-01-09 14:27:49,159 INFO L226 Difference]: Without dead ends: 28840 [2025-01-09 14:27:49,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-01-09 14:27:49,183 INFO L435 NwaCegarLoop]: 713 mSDtfsCounter, 639 mSDsluCounter, 4277 mSDsCounter, 0 mSdLazyCounter, 2057 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 4990 SdHoareTripleChecker+Invalid, 2061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:49,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 4990 Invalid, 2061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2057 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-09 14:27:49,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28840 states.