./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-36.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_fillercode_fillercodesize_ps-cn-500_file-36.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 5db290f428815e90a4f018b6e59020b3b572c51fa983142ee856b69fd7fa99fb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:04:13,706 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:04:13,763 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:04:13,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:04:13,769 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:04:13,794 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:04:13,795 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:04:13,795 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:04:13,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:04:13,796 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:04:13,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:04:13,796 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:04:13,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:04:13,796 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:04:13,796 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:04:13,796 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:04:13,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:04:13,797 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:04:13,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:04:13,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:04:13,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:04:13,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:04:13,797 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:04:13,797 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:04:13,797 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:04:13,797 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:04:13,797 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:04:13,798 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:04:13,798 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:04:13,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:04:13,798 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:04:13,798 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:04:13,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:04:13,798 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:04:13,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:04:13,798 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:04:13,798 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:04:13,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:04:13,799 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:04:13,799 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:04:13,799 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:04:13,799 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:04:13,799 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:04:13,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:04:13,799 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:04:13,799 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:04:13,799 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:04:13,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:04:13,799 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 -> 5db290f428815e90a4f018b6e59020b3b572c51fa983142ee856b69fd7fa99fb [2025-01-09 10:04:14,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:04:14,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:04:14,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:04:14,009 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:04:14,010 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:04:14,011 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-36.i [2025-01-09 10:04:15,154 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ec2df091/d6e1bc05a8cc4c1c904a16122ff16b68/FLAG510784d4c [2025-01-09 10:04:15,432 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:04:15,437 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-36.i [2025-01-09 10:04:15,449 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ec2df091/d6e1bc05a8cc4c1c904a16122ff16b68/FLAG510784d4c [2025-01-09 10:04:15,732 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ec2df091/d6e1bc05a8cc4c1c904a16122ff16b68 [2025-01-09 10:04:15,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:04:15,735 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:04:15,736 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:04:15,736 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:04:15,743 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:04:15,743 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:04:15" (1/1) ... [2025-01-09 10:04:15,744 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36758f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:15, skipping insertion in model container [2025-01-09 10:04:15,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:04:15" (1/1) ... [2025-01-09 10:04:15,778 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:04:15,889 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_fillercode_fillercodesize_ps-cn-500_file-36.i[916,929] [2025-01-09 10:04:16,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:04:16,070 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:04:16,079 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_fillercode_fillercodesize_ps-cn-500_file-36.i[916,929] [2025-01-09 10:04:16,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:04:16,167 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:04:16,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:16 WrapperNode [2025-01-09 10:04:16,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:04:16,169 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:04:16,169 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:04:16,169 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:04:16,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:16" (1/1) ... [2025-01-09 10:04:16,194 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:16" (1/1) ... [2025-01-09 10:04:16,280 INFO L138 Inliner]: procedures = 26, calls = 106, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 868 [2025-01-09 10:04:16,281 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:04:16,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:04:16,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:04:16,282 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:04:16,289 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:16" (1/1) ... [2025-01-09 10:04:16,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:16" (1/1) ... [2025-01-09 10:04:16,302 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:16" (1/1) ... [2025-01-09 10:04:16,339 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 10:04:16,339 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:16" (1/1) ... [2025-01-09 10:04:16,339 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:16" (1/1) ... [2025-01-09 10:04:16,361 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:16" (1/1) ... [2025-01-09 10:04:16,366 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:16" (1/1) ... [2025-01-09 10:04:16,376 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:16" (1/1) ... [2025-01-09 10:04:16,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:16" (1/1) ... [2025-01-09 10:04:16,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:16" (1/1) ... [2025-01-09 10:04:16,414 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:04:16,415 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:04:16,415 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:04:16,416 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:04:16,416 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:16" (1/1) ... [2025-01-09 10:04:16,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:04:16,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:04:16,444 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 10:04:16,447 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 10:04:16,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:04:16,466 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:04:16,466 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:04:16,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:04:16,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:04:16,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:04:16,587 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:04:16,589 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:04:17,666 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-01-09 10:04:17,666 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:04:17,683 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:04:17,686 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:04:17,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:04:17 BoogieIcfgContainer [2025-01-09 10:04:17,687 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:04:17,688 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:04:17,689 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:04:17,693 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:04:17,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:04:15" (1/3) ... [2025-01-09 10:04:17,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46a36ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:04:17, skipping insertion in model container [2025-01-09 10:04:17,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:16" (2/3) ... [2025-01-09 10:04:17,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46a36ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:04:17, skipping insertion in model container [2025-01-09 10:04:17,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:04:17" (3/3) ... [2025-01-09 10:04:17,696 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-36.i [2025-01-09 10:04:17,707 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:04:17,713 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-36.i that has 2 procedures, 351 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:04:17,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:04:17,781 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;@70afb903, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:04:17,781 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:04:17,787 INFO L276 IsEmpty]: Start isEmpty. Operand has 351 states, 255 states have (on average 1.619607843137255) internal successors, (413), 256 states have internal predecessors, (413), 93 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 10:04:17,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-01-09 10:04:17,817 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:17,818 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:04:17,819 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:17,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:17,824 INFO L85 PathProgramCache]: Analyzing trace with hash -544874071, now seen corresponding path program 1 times [2025-01-09 10:04:17,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:17,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006153734] [2025-01-09 10:04:17,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:17,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:17,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-01-09 10:04:17,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-01-09 10:04:17,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:17,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:18,336 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 16928 trivial. 0 not checked. [2025-01-09 10:04:18,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:18,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006153734] [2025-01-09 10:04:18,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006153734] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:04:18,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194589316] [2025-01-09 10:04:18,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:18,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:04:18,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:04:18,342 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 10:04:18,344 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 10:04:18,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-01-09 10:04:18,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-01-09 10:04:18,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:18,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:18,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 1413 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:04:18,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:04:18,736 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 16928 trivial. 0 not checked. [2025-01-09 10:04:18,737 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:04:18,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194589316] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:18,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:04:18,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:04:18,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226638315] [2025-01-09 10:04:18,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:18,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:04:18,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:18,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:04:18,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:04:18,769 INFO L87 Difference]: Start difference. First operand has 351 states, 255 states have (on average 1.619607843137255) internal successors, (413), 256 states have internal predecessors, (413), 93 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) Second operand has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 2 states have call successors, (93), 2 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 2 states have call successors, (93) [2025-01-09 10:04:18,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:18,836 INFO L93 Difference]: Finished difference Result 693 states and 1281 transitions. [2025-01-09 10:04:18,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:04:18,838 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 2 states have call successors, (93), 2 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 2 states have call successors, (93) Word has length 608 [2025-01-09 10:04:18,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:18,850 INFO L225 Difference]: With dead ends: 693 [2025-01-09 10:04:18,850 INFO L226 Difference]: Without dead ends: 345 [2025-01-09 10:04:18,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 609 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 10:04:18,859 INFO L435 NwaCegarLoop]: 587 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, 587 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 10:04:18,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:18,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-01-09 10:04:18,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2025-01-09 10:04:18,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 250 states have (on average 1.604) internal successors, (401), 250 states have internal predecessors, (401), 93 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 10:04:18,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 587 transitions. [2025-01-09 10:04:18,936 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 587 transitions. Word has length 608 [2025-01-09 10:04:18,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:18,937 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 587 transitions. [2025-01-09 10:04:18,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 2 states have call successors, (93), 2 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 2 states have call successors, (93) [2025-01-09 10:04:18,937 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 587 transitions. [2025-01-09 10:04:18,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-01-09 10:04:18,958 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:18,958 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:04:18,970 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 10:04:19,159 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 10:04:19,159 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:19,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:19,160 INFO L85 PathProgramCache]: Analyzing trace with hash -697222825, now seen corresponding path program 1 times [2025-01-09 10:04:19,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:19,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464709535] [2025-01-09 10:04:19,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:19,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:19,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-01-09 10:04:19,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-01-09 10:04:19,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:19,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:19,823 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-01-09 10:04:19,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:19,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464709535] [2025-01-09 10:04:19,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464709535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:19,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:19,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:04:19,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886872025] [2025-01-09 10:04:19,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:19,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:04:19,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:19,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:04:19,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:19,828 INFO L87 Difference]: Start difference. First operand 345 states and 587 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:04:19,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:19,913 INFO L93 Difference]: Finished difference Result 924 states and 1580 transitions. [2025-01-09 10:04:19,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:04:19,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 608 [2025-01-09 10:04:19,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:19,922 INFO L225 Difference]: With dead ends: 924 [2025-01-09 10:04:19,922 INFO L226 Difference]: Without dead ends: 582 [2025-01-09 10:04:19,923 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 10:04:19,924 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 407 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:19,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1156 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:19,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-01-09 10:04:19,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 579. [2025-01-09 10:04:19,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 445 states have (on average 1.6404494382022472) internal successors, (730), 446 states have internal predecessors, (730), 131 states have call successors, (131), 2 states have call predecessors, (131), 2 states have return successors, (131), 130 states have call predecessors, (131), 131 states have call successors, (131) [2025-01-09 10:04:19,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 992 transitions. [2025-01-09 10:04:19,992 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 992 transitions. Word has length 608 [2025-01-09 10:04:19,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:19,993 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 992 transitions. [2025-01-09 10:04:19,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:04:19,994 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 992 transitions. [2025-01-09 10:04:20,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-01-09 10:04:20,001 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:20,001 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:04:20,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:04:20,001 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:20,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:20,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1520407573, now seen corresponding path program 1 times [2025-01-09 10:04:20,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:20,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152950152] [2025-01-09 10:04:20,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:20,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:20,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-01-09 10:04:20,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-01-09 10:04:20,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:20,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:20,393 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-01-09 10:04:20,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:20,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152950152] [2025-01-09 10:04:20,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152950152] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:20,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:20,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:04:20,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526401905] [2025-01-09 10:04:20,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:20,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:04:20,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:20,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:04:20,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:20,401 INFO L87 Difference]: Start difference. First operand 579 states and 992 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:04:20,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:20,486 INFO L93 Difference]: Finished difference Result 1606 states and 2763 transitions. [2025-01-09 10:04:20,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:04:20,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 608 [2025-01-09 10:04:20,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:20,494 INFO L225 Difference]: With dead ends: 1606 [2025-01-09 10:04:20,495 INFO L226 Difference]: Without dead ends: 1030 [2025-01-09 10:04:20,496 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 10:04:20,497 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 403 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:20,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1403 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:20,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2025-01-09 10:04:20,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1026. [2025-01-09 10:04:20,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 830 states have (on average 1.6674698795180722) internal successors, (1384), 833 states have internal predecessors, (1384), 191 states have call successors, (191), 4 states have call predecessors, (191), 4 states have return successors, (191), 188 states have call predecessors, (191), 191 states have call successors, (191) [2025-01-09 10:04:20,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1766 transitions. [2025-01-09 10:04:20,573 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1766 transitions. Word has length 608 [2025-01-09 10:04:20,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:20,576 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1766 transitions. [2025-01-09 10:04:20,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:04:20,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1766 transitions. [2025-01-09 10:04:20,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-01-09 10:04:20,585 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:20,585 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:04:20,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:04:20,586 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:20,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:20,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1760647319, now seen corresponding path program 1 times [2025-01-09 10:04:20,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:20,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998915133] [2025-01-09 10:04:20,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:20,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:20,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-01-09 10:04:20,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-01-09 10:04:20,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:20,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:20,925 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-01-09 10:04:20,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:20,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998915133] [2025-01-09 10:04:20,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998915133] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:20,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:20,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:04:20,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060098362] [2025-01-09 10:04:20,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:20,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:04:20,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:20,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:04:20,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:20,927 INFO L87 Difference]: Start difference. First operand 1026 states and 1766 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:04:21,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:21,037 INFO L93 Difference]: Finished difference Result 2926 states and 5048 transitions. [2025-01-09 10:04:21,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:04:21,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 608 [2025-01-09 10:04:21,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:21,049 INFO L225 Difference]: With dead ends: 2926 [2025-01-09 10:04:21,050 INFO L226 Difference]: Without dead ends: 1903 [2025-01-09 10:04:21,053 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 10:04:21,053 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 380 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:21,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1132 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:21,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2025-01-09 10:04:21,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1897. [2025-01-09 10:04:21,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1601 states have (on average 1.6851967520299813) internal successors, (2698), 1608 states have internal predecessors, (2698), 287 states have call successors, (287), 8 states have call predecessors, (287), 8 states have return successors, (287), 280 states have call predecessors, (287), 287 states have call successors, (287) [2025-01-09 10:04:21,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 3272 transitions. [2025-01-09 10:04:21,130 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 3272 transitions. Word has length 608 [2025-01-09 10:04:21,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:21,131 INFO L471 AbstractCegarLoop]: Abstraction has 1897 states and 3272 transitions. [2025-01-09 10:04:21,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:04:21,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 3272 transitions. [2025-01-09 10:04:21,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-01-09 10:04:21,142 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:21,142 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:04:21,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:04:21,142 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:21,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:21,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1855047723, now seen corresponding path program 1 times [2025-01-09 10:04:21,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:21,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980850498] [2025-01-09 10:04:21,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:21,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:21,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-01-09 10:04:21,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-01-09 10:04:21,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:21,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:21,413 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-01-09 10:04:21,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:21,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980850498] [2025-01-09 10:04:21,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980850498] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:21,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:21,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:04:21,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862055972] [2025-01-09 10:04:21,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:21,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:04:21,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:21,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:04:21,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:21,417 INFO L87 Difference]: Start difference. First operand 1897 states and 3272 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:04:21,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:21,550 INFO L93 Difference]: Finished difference Result 5064 states and 8701 transitions. [2025-01-09 10:04:21,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:04:21,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 608 [2025-01-09 10:04:21,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:21,572 INFO L225 Difference]: With dead ends: 5064 [2025-01-09 10:04:21,572 INFO L226 Difference]: Without dead ends: 3170 [2025-01-09 10:04:21,579 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 10:04:21,582 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 313 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:21,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1291 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:21,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2025-01-09 10:04:21,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 3167. [2025-01-09 10:04:21,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3167 states, 2627 states have (on average 1.6627331556909022) internal successors, (4368), 2642 states have internal predecessors, (4368), 523 states have call successors, (523), 16 states have call predecessors, (523), 16 states have return successors, (523), 508 states have call predecessors, (523), 523 states have call successors, (523) [2025-01-09 10:04:21,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3167 states to 3167 states and 5414 transitions. [2025-01-09 10:04:21,708 INFO L78 Accepts]: Start accepts. Automaton has 3167 states and 5414 transitions. Word has length 608 [2025-01-09 10:04:21,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:21,709 INFO L471 AbstractCegarLoop]: Abstraction has 3167 states and 5414 transitions. [2025-01-09 10:04:21,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:04:21,710 INFO L276 IsEmpty]: Start isEmpty. Operand 3167 states and 5414 transitions. [2025-01-09 10:04:21,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-01-09 10:04:21,716 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:21,716 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:04:21,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:04:21,717 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:21,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:21,717 INFO L85 PathProgramCache]: Analyzing trace with hash -316707693, now seen corresponding path program 1 times [2025-01-09 10:04:21,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:21,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729555039] [2025-01-09 10:04:21,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:21,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:21,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-01-09 10:04:21,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-01-09 10:04:21,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:21,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:21,964 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-01-09 10:04:21,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:21,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729555039] [2025-01-09 10:04:21,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729555039] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:21,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:21,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:04:21,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255298538] [2025-01-09 10:04:21,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:21,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:04:21,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:21,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:04:21,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:21,969 INFO L87 Difference]: Start difference. First operand 3167 states and 5414 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:04:22,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:22,158 INFO L93 Difference]: Finished difference Result 9415 states and 16100 transitions. [2025-01-09 10:04:22,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:04:22,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 608 [2025-01-09 10:04:22,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:22,200 INFO L225 Difference]: With dead ends: 9415 [2025-01-09 10:04:22,200 INFO L226 Difference]: Without dead ends: 6251 [2025-01-09 10:04:22,211 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 10:04:22,213 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 561 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:22,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1158 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:22,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6251 states. [2025-01-09 10:04:22,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6251 to 6249. [2025-01-09 10:04:22,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6249 states, 5170 states have (on average 1.6502901353965185) internal successors, (8532), 5200 states have internal predecessors, (8532), 1046 states have call successors, (1046), 32 states have call predecessors, (1046), 32 states have return successors, (1046), 1016 states have call predecessors, (1046), 1046 states have call successors, (1046) [2025-01-09 10:04:22,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6249 states to 6249 states and 10624 transitions. [2025-01-09 10:04:22,520 INFO L78 Accepts]: Start accepts. Automaton has 6249 states and 10624 transitions. Word has length 608 [2025-01-09 10:04:22,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:22,521 INFO L471 AbstractCegarLoop]: Abstraction has 6249 states and 10624 transitions. [2025-01-09 10:04:22,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:04:22,521 INFO L276 IsEmpty]: Start isEmpty. Operand 6249 states and 10624 transitions. [2025-01-09 10:04:22,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-01-09 10:04:22,531 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:22,531 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:04:22,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:04:22,531 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:22,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:22,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1825375059, now seen corresponding path program 1 times [2025-01-09 10:04:22,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:22,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764134244] [2025-01-09 10:04:22,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:22,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:22,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-01-09 10:04:22,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-01-09 10:04:22,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:22,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:22,744 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-01-09 10:04:22,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:22,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764134244] [2025-01-09 10:04:22,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764134244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:22,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:22,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:04:22,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286861285] [2025-01-09 10:04:22,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:22,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:04:22,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:22,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:04:22,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:22,747 INFO L87 Difference]: Start difference. First operand 6249 states and 10624 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:04:23,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:23,111 INFO L93 Difference]: Finished difference Result 16773 states and 28330 transitions. [2025-01-09 10:04:23,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:04:23,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 608 [2025-01-09 10:04:23,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:23,176 INFO L225 Difference]: With dead ends: 16773 [2025-01-09 10:04:23,179 INFO L226 Difference]: Without dead ends: 10527 [2025-01-09 10:04:23,197 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 10:04:23,198 INFO L435 NwaCegarLoop]: 946 mSDtfsCounter, 424 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:23,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 1515 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:23,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10527 states. [2025-01-09 10:04:23,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10527 to 7241. [2025-01-09 10:04:23,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7241 states, 6162 states have (on average 1.6520610191496268) internal successors, (10180), 6192 states have internal predecessors, (10180), 1046 states have call successors, (1046), 32 states have call predecessors, (1046), 32 states have return successors, (1046), 1016 states have call predecessors, (1046), 1046 states have call successors, (1046) [2025-01-09 10:04:23,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7241 states to 7241 states and 12272 transitions. [2025-01-09 10:04:23,694 INFO L78 Accepts]: Start accepts. Automaton has 7241 states and 12272 transitions. Word has length 608 [2025-01-09 10:04:23,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:23,696 INFO L471 AbstractCegarLoop]: Abstraction has 7241 states and 12272 transitions. [2025-01-09 10:04:23,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:04:23,697 INFO L276 IsEmpty]: Start isEmpty. Operand 7241 states and 12272 transitions. [2025-01-09 10:04:23,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-01-09 10:04:23,707 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:23,707 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:04:23,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:04:23,708 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:23,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:23,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1007726609, now seen corresponding path program 1 times [2025-01-09 10:04:23,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:23,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380760598] [2025-01-09 10:04:23,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:23,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:23,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-01-09 10:04:23,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-01-09 10:04:23,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:23,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:23,923 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-01-09 10:04:23,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:23,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380760598] [2025-01-09 10:04:23,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380760598] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:23,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:23,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:04:23,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894321780] [2025-01-09 10:04:23,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:23,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:04:23,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:23,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:04:23,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:23,925 INFO L87 Difference]: Start difference. First operand 7241 states and 12272 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:04:24,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:24,257 INFO L93 Difference]: Finished difference Result 21717 states and 36810 transitions. [2025-01-09 10:04:24,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:04:24,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 608 [2025-01-09 10:04:24,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:24,308 INFO L225 Difference]: With dead ends: 21717 [2025-01-09 10:04:24,309 INFO L226 Difference]: Without dead ends: 14479 [2025-01-09 10:04:24,335 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 10:04:24,336 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 573 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:24,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 1173 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:24,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14479 states. [2025-01-09 10:04:24,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14479 to 14477. [2025-01-09 10:04:24,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14477 states, 12320 states have (on average 1.6496753246753246) internal successors, (20324), 12380 states have internal predecessors, (20324), 2092 states have call successors, (2092), 64 states have call predecessors, (2092), 64 states have return successors, (2092), 2032 states have call predecessors, (2092), 2092 states have call successors, (2092) [2025-01-09 10:04:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14477 states to 14477 states and 24508 transitions. [2025-01-09 10:04:24,921 INFO L78 Accepts]: Start accepts. Automaton has 14477 states and 24508 transitions. Word has length 608 [2025-01-09 10:04:24,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:24,922 INFO L471 AbstractCegarLoop]: Abstraction has 14477 states and 24508 transitions. [2025-01-09 10:04:24,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:04:24,923 INFO L276 IsEmpty]: Start isEmpty. Operand 14477 states and 24508 transitions. [2025-01-09 10:04:24,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-01-09 10:04:24,994 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:24,995 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:04:24,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:04:24,995 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:24,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:24,996 INFO L85 PathProgramCache]: Analyzing trace with hash -986418097, now seen corresponding path program 1 times [2025-01-09 10:04:24,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:24,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370496084] [2025-01-09 10:04:24,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:24,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:25,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-01-09 10:04:25,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-01-09 10:04:25,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:25,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:25,214 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-01-09 10:04:25,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:25,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370496084] [2025-01-09 10:04:25,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370496084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:25,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:25,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:04:25,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361491619] [2025-01-09 10:04:25,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:25,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:04:25,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:25,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:04:25,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:25,217 INFO L87 Difference]: Start difference. First operand 14477 states and 24508 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:04:25,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:25,671 INFO L93 Difference]: Finished difference Result 28973 states and 49030 transitions. [2025-01-09 10:04:25,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:04:25,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 608 [2025-01-09 10:04:25,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:25,723 INFO L225 Difference]: With dead ends: 28973 [2025-01-09 10:04:25,724 INFO L226 Difference]: Without dead ends: 14499 [2025-01-09 10:04:25,760 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 10:04:25,763 INFO L435 NwaCegarLoop]: 699 mSDtfsCounter, 270 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:25,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1274 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:25,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14499 states. [2025-01-09 10:04:26,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14499 to 11989. [2025-01-09 10:04:26,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11989 states, 10804 states have (on average 1.6786375416512402) internal successors, (18136), 10832 states have internal predecessors, (18136), 1148 states have call successors, (1148), 36 states have call predecessors, (1148), 36 states have return successors, (1148), 1120 states have call predecessors, (1148), 1148 states have call successors, (1148) [2025-01-09 10:04:26,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11989 states to 11989 states and 20432 transitions. [2025-01-09 10:04:26,394 INFO L78 Accepts]: Start accepts. Automaton has 11989 states and 20432 transitions. Word has length 608 [2025-01-09 10:04:26,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:26,395 INFO L471 AbstractCegarLoop]: Abstraction has 11989 states and 20432 transitions. [2025-01-09 10:04:26,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:04:26,396 INFO L276 IsEmpty]: Start isEmpty. Operand 11989 states and 20432 transitions. [2025-01-09 10:04:26,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-01-09 10:04:26,411 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:26,412 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:04:26,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:04:26,412 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:26,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:26,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1720201297, now seen corresponding path program 1 times [2025-01-09 10:04:26,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:26,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630206341] [2025-01-09 10:04:26,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:26,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:26,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-01-09 10:04:26,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-01-09 10:04:26,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:26,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:26,649 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-01-09 10:04:26,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:26,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630206341] [2025-01-09 10:04:26,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630206341] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:26,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:26,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:04:26,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836069651] [2025-01-09 10:04:26,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:26,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:04:26,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:26,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:04:26,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:26,651 INFO L87 Difference]: Start difference. First operand 11989 states and 20432 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:04:27,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:27,149 INFO L93 Difference]: Finished difference Result 32781 states and 55522 transitions. [2025-01-09 10:04:27,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:04:27,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 608 [2025-01-09 10:04:27,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:27,208 INFO L225 Difference]: With dead ends: 32781 [2025-01-09 10:04:27,208 INFO L226 Difference]: Without dead ends: 20795 [2025-01-09 10:04:27,233 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 10:04:27,234 INFO L435 NwaCegarLoop]: 777 mSDtfsCounter, 330 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:27,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1348 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:27,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20795 states. [2025-01-09 10:04:27,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20795 to 20789. [2025-01-09 10:04:27,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20789 states, 18492 states have (on average 1.6413584252649795) internal successors, (30352), 18552 states have internal predecessors, (30352), 2224 states have call successors, (2224), 72 states have call predecessors, (2224), 72 states have return successors, (2224), 2164 states have call predecessors, (2224), 2224 states have call successors, (2224) [2025-01-09 10:04:27,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20789 states to 20789 states and 34800 transitions. [2025-01-09 10:04:27,827 INFO L78 Accepts]: Start accepts. Automaton has 20789 states and 34800 transitions. Word has length 608 [2025-01-09 10:04:27,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:27,828 INFO L471 AbstractCegarLoop]: Abstraction has 20789 states and 34800 transitions. [2025-01-09 10:04:27,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:04:27,828 INFO L276 IsEmpty]: Start isEmpty. Operand 20789 states and 34800 transitions. [2025-01-09 10:04:27,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-01-09 10:04:27,903 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:27,903 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:04:27,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:04:27,903 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:27,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:27,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1553697645, now seen corresponding path program 1 times [2025-01-09 10:04:27,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:27,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327503114] [2025-01-09 10:04:27,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:27,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:27,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-01-09 10:04:27,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-01-09 10:04:27,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:27,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:28,296 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-01-09 10:04:28,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:28,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327503114] [2025-01-09 10:04:28,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327503114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:28,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:28,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:04:28,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365394768] [2025-01-09 10:04:28,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:28,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:04:28,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:28,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:04:28,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:04:28,298 INFO L87 Difference]: Start difference. First operand 20789 states and 34800 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:04:32,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:32,043 INFO L93 Difference]: Finished difference Result 119207 states and 198986 transitions. [2025-01-09 10:04:32,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 10:04:32,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 608 [2025-01-09 10:04:32,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:32,347 INFO L225 Difference]: With dead ends: 119207 [2025-01-09 10:04:32,347 INFO L226 Difference]: Without dead ends: 98421 [2025-01-09 10:04:32,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:04:32,402 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 2460 mSDsluCounter, 1906 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2460 SdHoareTripleChecker+Valid, 2773 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:32,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2460 Valid, 2773 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 10:04:32,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98421 states. [2025-01-09 10:04:34,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98421 to 79508. [2025-01-09 10:04:35,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79508 states, 71544 states have (on average 1.6405568601140557) internal successors, (117372), 71797 states have internal predecessors, (117372), 7610 states have call successors, (7610), 353 states have call predecessors, (7610), 353 states have return successors, (7610), 7357 states have call predecessors, (7610), 7610 states have call successors, (7610) [2025-01-09 10:04:35,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79508 states to 79508 states and 132592 transitions. [2025-01-09 10:04:35,281 INFO L78 Accepts]: Start accepts. Automaton has 79508 states and 132592 transitions. Word has length 608 [2025-01-09 10:04:35,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:35,282 INFO L471 AbstractCegarLoop]: Abstraction has 79508 states and 132592 transitions. [2025-01-09 10:04:35,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:04:35,282 INFO L276 IsEmpty]: Start isEmpty. Operand 79508 states and 132592 transitions. [2025-01-09 10:04:35,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-01-09 10:04:35,368 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:35,369 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:04:35,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:04:35,369 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:35,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:35,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1525115925, now seen corresponding path program 1 times [2025-01-09 10:04:35,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:35,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106727610] [2025-01-09 10:04:35,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:35,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:35,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-01-09 10:04:35,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-01-09 10:04:35,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:35,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:35,725 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-01-09 10:04:35,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:35,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106727610] [2025-01-09 10:04:35,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106727610] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:35,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:35,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:04:35,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049586090] [2025-01-09 10:04:35,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:35,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:04:35,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:35,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:04:35,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:04:35,727 INFO L87 Difference]: Start difference. First operand 79508 states and 132592 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:04:39,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:39,051 INFO L93 Difference]: Finished difference Result 216841 states and 361702 transitions. [2025-01-09 10:04:39,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:04:39,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 608 [2025-01-09 10:04:39,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:39,368 INFO L225 Difference]: With dead ends: 216841 [2025-01-09 10:04:39,368 INFO L226 Difference]: Without dead ends: 137383 [2025-01-09 10:04:39,478 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 10:04:39,480 INFO L435 NwaCegarLoop]: 950 mSDtfsCounter, 775 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 2211 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:39,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 2211 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:04:39,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137383 states. [2025-01-09 10:04:43,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137383 to 99067. [2025-01-09 10:04:43,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99067 states, 89107 states have (on average 1.6389172567811732) internal successors, (146039), 89424 states have internal predecessors, (146039), 9508 states have call successors, (9508), 451 states have call predecessors, (9508), 451 states have return successors, (9508), 9191 states have call predecessors, (9508), 9508 states have call successors, (9508) [2025-01-09 10:04:43,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99067 states to 99067 states and 165055 transitions. [2025-01-09 10:04:43,848 INFO L78 Accepts]: Start accepts. Automaton has 99067 states and 165055 transitions. Word has length 608 [2025-01-09 10:04:43,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:43,849 INFO L471 AbstractCegarLoop]: Abstraction has 99067 states and 165055 transitions. [2025-01-09 10:04:43,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:04:43,849 INFO L276 IsEmpty]: Start isEmpty. Operand 99067 states and 165055 transitions. [2025-01-09 10:04:43,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-01-09 10:04:43,929 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:43,929 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:04:43,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:04:43,929 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:43,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:43,930 INFO L85 PathProgramCache]: Analyzing trace with hash -599757487, now seen corresponding path program 1 times [2025-01-09 10:04:43,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:43,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882651375] [2025-01-09 10:04:43,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:43,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:43,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-01-09 10:04:44,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-01-09 10:04:44,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:44,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:44,855 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-01-09 10:04:44,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:44,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882651375] [2025-01-09 10:04:44,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882651375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:44,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:44,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 10:04:44,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815646831] [2025-01-09 10:04:44,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:44,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 10:04:44,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:44,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 10:04:44,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:04:44,858 INFO L87 Difference]: Start difference. First operand 99067 states and 165055 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:04:55,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:55,990 INFO L93 Difference]: Finished difference Result 440643 states and 732224 transitions. [2025-01-09 10:04:55,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 10:04:55,991 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 608 [2025-01-09 10:04:55,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:56,954 INFO L225 Difference]: With dead ends: 440643 [2025-01-09 10:04:56,955 INFO L226 Difference]: Without dead ends: 341649 [2025-01-09 10:04:57,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2025-01-09 10:04:57,089 INFO L435 NwaCegarLoop]: 962 mSDtfsCounter, 5153 mSDsluCounter, 4224 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 730 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5153 SdHoareTripleChecker+Valid, 5186 SdHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 730 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:57,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5153 Valid, 5186 Invalid, 1911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [730 Valid, 1181 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 10:04:57,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341649 states.