./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-8.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 2197c4d14fd5af1bc627adef461bd5f05d36e421274b7d409fe23e38f5f15829 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:50:48,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:50:49,044 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:50:49,047 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:50:49,047 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:50:49,061 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:50:49,061 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:50:49,061 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:50:49,061 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:50:49,062 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:50:49,062 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:50:49,062 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:50:49,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:50:49,062 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:50:49,062 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:50:49,062 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:50:49,062 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:50:49,062 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:50:49,062 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:50:49,062 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:50:49,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:50:49,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:50:49,062 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:50:49,062 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:50:49,063 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:50:49,063 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:50:49,063 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:50:49,063 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:50:49,063 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:50:49,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:50:49,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:50:49,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:50:49,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:50:49,063 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:50:49,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:50:49,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:50:49,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:50:49,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:50:49,063 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:50:49,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:50:49,063 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:50:49,063 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:50:49,063 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:50:49,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:50:49,064 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:50:49,064 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:50:49,064 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:50:49,064 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:50:49,064 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 -> 2197c4d14fd5af1bc627adef461bd5f05d36e421274b7d409fe23e38f5f15829 [2025-01-09 14:50:49,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:50:49,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:50:49,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:50:49,258 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:50:49,259 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:50:49,259 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-8.i [2025-01-09 14:50:50,319 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76c6c9091/75f6f3a13ce54a8c8ab710b884290ab9/FLAG779bba399 [2025-01-09 14:50:50,635 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:50:50,636 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-8.i [2025-01-09 14:50:50,650 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76c6c9091/75f6f3a13ce54a8c8ab710b884290ab9/FLAG779bba399 [2025-01-09 14:50:50,886 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76c6c9091/75f6f3a13ce54a8c8ab710b884290ab9 [2025-01-09 14:50:50,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:50:50,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:50:50,894 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:50:50,894 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:50:50,900 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:50:50,901 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:50:50" (1/1) ... [2025-01-09 14:50:50,901 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d97fe48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:50, skipping insertion in model container [2025-01-09 14:50:50,902 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:50:50" (1/1) ... [2025-01-09 14:50:50,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:50:51,060 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-8.i[915,928] [2025-01-09 14:50:51,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:50:51,288 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:50:51,296 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-8.i[915,928] [2025-01-09 14:50:51,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:50:51,405 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:50:51,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:51 WrapperNode [2025-01-09 14:50:51,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:50:51,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:50:51,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:50:51,408 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:50:51,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:51" (1/1) ... [2025-01-09 14:50:51,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:51" (1/1) ... [2025-01-09 14:50:51,507 INFO L138 Inliner]: procedures = 26, calls = 91, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 828 [2025-01-09 14:50:51,508 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:50:51,508 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:50:51,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:50:51,510 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:50:51,516 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:51" (1/1) ... [2025-01-09 14:50:51,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:51" (1/1) ... [2025-01-09 14:50:51,541 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:51" (1/1) ... [2025-01-09 14:50:51,626 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 14:50:51,627 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:51" (1/1) ... [2025-01-09 14:50:51,627 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:51" (1/1) ... [2025-01-09 14:50:51,653 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:51" (1/1) ... [2025-01-09 14:50:51,659 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:51" (1/1) ... [2025-01-09 14:50:51,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:51" (1/1) ... [2025-01-09 14:50:51,676 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:51" (1/1) ... [2025-01-09 14:50:51,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:51" (1/1) ... [2025-01-09 14:50:51,702 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:50:51,703 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:50:51,704 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:50:51,704 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:50:51,705 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:51" (1/1) ... [2025-01-09 14:50:51,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:50:51,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:50:51,732 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:50:51,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:50:51,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:50:51,759 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:50:51,759 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:50:51,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:50:51,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:50:51,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:50:51,892 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:50:51,893 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:50:52,976 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2025-01-09 14:50:52,977 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:50:52,994 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:50:52,995 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:50:52,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:50:52 BoogieIcfgContainer [2025-01-09 14:50:52,996 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:50:52,997 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:50:52,997 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:50:53,000 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:50:53,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:50:50" (1/3) ... [2025-01-09 14:50:53,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d187c5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:50:53, skipping insertion in model container [2025-01-09 14:50:53,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:50:51" (2/3) ... [2025-01-09 14:50:53,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d187c5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:50:53, skipping insertion in model container [2025-01-09 14:50:53,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:50:52" (3/3) ... [2025-01-09 14:50:53,004 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-8.i [2025-01-09 14:50:53,014 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:50:53,017 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-8.i that has 2 procedures, 330 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:50:53,067 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:50:53,077 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;@6a916c70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:50:53,077 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:50:53,080 INFO L276 IsEmpty]: Start isEmpty. Operand has 330 states, 249 states have (on average 1.5140562248995983) internal successors, (377), 250 states have internal predecessors, (377), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 14:50:53,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2025-01-09 14:50:53,104 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:53,105 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:50:53,105 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:53,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:53,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1837698061, now seen corresponding path program 1 times [2025-01-09 14:50:53,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:53,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277280446] [2025-01-09 14:50:53,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:53,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:53,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-01-09 14:50:53,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-01-09 14:50:53,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:53,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:53,735 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 11858 trivial. 0 not checked. [2025-01-09 14:50:53,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:53,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277280446] [2025-01-09 14:50:53,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277280446] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:50:53,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392736134] [2025-01-09 14:50:53,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:53,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:50:53,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:50:53,741 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:50:53,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 14:50:53,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-01-09 14:50:54,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-01-09 14:50:54,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:54,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:54,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 1388 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:50:54,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:50:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 11858 trivial. 0 not checked. [2025-01-09 14:50:54,165 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:50:54,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392736134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:54,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:50:54,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:50:54,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328892136] [2025-01-09 14:50:54,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:54,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:50:54,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:54,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:50:54,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:50:54,206 INFO L87 Difference]: Start difference. First operand has 330 states, 249 states have (on average 1.5140562248995983) internal successors, (377), 250 states have internal predecessors, (377), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) Second operand has 2 states, 2 states have (on average 85.0) internal successors, (170), 2 states have internal predecessors, (170), 2 states have call successors, (78), 2 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 2 states have call successors, (78) [2025-01-09 14:50:54,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:54,280 INFO L93 Difference]: Finished difference Result 654 states and 1139 transitions. [2025-01-09 14:50:54,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:50:54,281 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 85.0) internal successors, (170), 2 states have internal predecessors, (170), 2 states have call successors, (78), 2 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 2 states have call successors, (78) Word has length 555 [2025-01-09 14:50:54,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:54,296 INFO L225 Difference]: With dead ends: 654 [2025-01-09 14:50:54,296 INFO L226 Difference]: Without dead ends: 327 [2025-01-09 14:50:54,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 556 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:50:54,306 INFO L435 NwaCegarLoop]: 525 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, 525 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:54,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:50:54,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-01-09 14:50:54,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2025-01-09 14:50:54,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 247 states have (on average 1.4939271255060729) internal successors, (369), 247 states have internal predecessors, (369), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 14:50:54,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 525 transitions. [2025-01-09 14:50:54,382 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 525 transitions. Word has length 555 [2025-01-09 14:50:54,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:54,383 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 525 transitions. [2025-01-09 14:50:54,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 85.0) internal successors, (170), 2 states have internal predecessors, (170), 2 states have call successors, (78), 2 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 2 states have call successors, (78) [2025-01-09 14:50:54,384 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 525 transitions. [2025-01-09 14:50:54,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2025-01-09 14:50:54,396 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:54,397 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:50:54,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 14:50:54,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:50:54,601 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:54,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:54,603 INFO L85 PathProgramCache]: Analyzing trace with hash 788122743, now seen corresponding path program 1 times [2025-01-09 14:50:54,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:54,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925989645] [2025-01-09 14:50:54,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:54,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:54,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-01-09 14:50:54,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-01-09 14:50:54,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:54,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:55,177 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-01-09 14:50:55,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:55,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925989645] [2025-01-09 14:50:55,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925989645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:55,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:55,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:50:55,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272607261] [2025-01-09 14:50:55,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:55,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:50:55,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:55,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:50:55,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:50:55,184 INFO L87 Difference]: Start difference. First operand 327 states and 525 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-01-09 14:50:55,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:55,262 INFO L93 Difference]: Finished difference Result 864 states and 1381 transitions. [2025-01-09 14:50:55,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:50:55,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 555 [2025-01-09 14:50:55,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:55,268 INFO L225 Difference]: With dead ends: 864 [2025-01-09 14:50:55,268 INFO L226 Difference]: Without dead ends: 540 [2025-01-09 14:50:55,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:50:55,269 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 325 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:55,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 1104 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:50:55,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-01-09 14:50:55,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 537. [2025-01-09 14:50:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 428 states have (on average 1.5023364485981308) internal successors, (643), 429 states have internal predecessors, (643), 106 states have call successors, (106), 2 states have call predecessors, (106), 2 states have return successors, (106), 105 states have call predecessors, (106), 106 states have call successors, (106) [2025-01-09 14:50:55,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 855 transitions. [2025-01-09 14:50:55,315 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 855 transitions. Word has length 555 [2025-01-09 14:50:55,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:55,316 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 855 transitions. [2025-01-09 14:50:55,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-01-09 14:50:55,316 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 855 transitions. [2025-01-09 14:50:55,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2025-01-09 14:50:55,333 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:55,334 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:50:55,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:50:55,334 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:55,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:55,335 INFO L85 PathProgramCache]: Analyzing trace with hash 959975795, now seen corresponding path program 1 times [2025-01-09 14:50:55,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:55,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138157193] [2025-01-09 14:50:55,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:55,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:55,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-01-09 14:50:55,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-01-09 14:50:55,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:55,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:55,896 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-01-09 14:50:55,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:55,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138157193] [2025-01-09 14:50:55,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138157193] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:55,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:55,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:50:55,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613246370] [2025-01-09 14:50:55,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:55,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:50:55,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:55,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:50:55,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:50:55,899 INFO L87 Difference]: Start difference. First operand 537 states and 855 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-01-09 14:50:56,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:56,012 INFO L93 Difference]: Finished difference Result 1299 states and 2056 transitions. [2025-01-09 14:50:56,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:50:56,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 555 [2025-01-09 14:50:56,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:56,021 INFO L225 Difference]: With dead ends: 1299 [2025-01-09 14:50:56,023 INFO L226 Difference]: Without dead ends: 765 [2025-01-09 14:50:56,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:50:56,026 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 162 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:56,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1044 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:50:56,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2025-01-09 14:50:56,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 761. [2025-01-09 14:50:56,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 624 states have (on average 1.4919871794871795) internal successors, (931), 627 states have internal predecessors, (931), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 129 states have call predecessors, (132), 132 states have call successors, (132) [2025-01-09 14:50:56,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1195 transitions. [2025-01-09 14:50:56,082 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1195 transitions. Word has length 555 [2025-01-09 14:50:56,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:56,084 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 1195 transitions. [2025-01-09 14:50:56,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-01-09 14:50:56,085 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1195 transitions. [2025-01-09 14:50:56,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2025-01-09 14:50:56,095 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:56,095 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:50:56,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:50:56,096 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:56,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:56,097 INFO L85 PathProgramCache]: Analyzing trace with hash -944060115, now seen corresponding path program 1 times [2025-01-09 14:50:56,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:56,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128778244] [2025-01-09 14:50:56,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:56,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:56,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-01-09 14:50:56,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-01-09 14:50:56,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:56,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:57,859 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-01-09 14:50:57,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:57,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128778244] [2025-01-09 14:50:57,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128778244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:57,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:57,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 14:50:57,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939601256] [2025-01-09 14:50:57,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:57,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:50:57,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:57,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:50:57,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:50:57,865 INFO L87 Difference]: Start difference. First operand 761 states and 1195 transitions. Second operand has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-01-09 14:50:59,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:59,433 INFO L93 Difference]: Finished difference Result 3382 states and 5297 transitions. [2025-01-09 14:50:59,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 14:50:59,434 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 555 [2025-01-09 14:50:59,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:59,448 INFO L225 Difference]: With dead ends: 3382 [2025-01-09 14:50:59,448 INFO L226 Difference]: Without dead ends: 2624 [2025-01-09 14:50:59,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:50:59,452 INFO L435 NwaCegarLoop]: 937 mSDtfsCounter, 1583 mSDsluCounter, 4301 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 416 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1583 SdHoareTripleChecker+Valid, 5238 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 416 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:59,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1583 Valid, 5238 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [416 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 14:50:59,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2025-01-09 14:50:59,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 2194. [2025-01-09 14:50:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2194 states, 1772 states have (on average 1.4802483069977426) internal successors, (2623), 1783 states have internal predecessors, (2623), 408 states have call successors, (408), 13 states have call predecessors, (408), 13 states have return successors, (408), 397 states have call predecessors, (408), 408 states have call successors, (408) [2025-01-09 14:50:59,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2194 states to 2194 states and 3439 transitions. [2025-01-09 14:50:59,625 INFO L78 Accepts]: Start accepts. Automaton has 2194 states and 3439 transitions. Word has length 555 [2025-01-09 14:50:59,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:59,626 INFO L471 AbstractCegarLoop]: Abstraction has 2194 states and 3439 transitions. [2025-01-09 14:50:59,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-01-09 14:50:59,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2194 states and 3439 transitions. [2025-01-09 14:50:59,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2025-01-09 14:50:59,634 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:59,634 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:50:59,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:50:59,634 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:59,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:59,635 INFO L85 PathProgramCache]: Analyzing trace with hash 995101931, now seen corresponding path program 1 times [2025-01-09 14:50:59,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:59,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238722169] [2025-01-09 14:50:59,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:59,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:59,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-01-09 14:50:59,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-01-09 14:50:59,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:59,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:00,490 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-01-09 14:51:00,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:00,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238722169] [2025-01-09 14:51:00,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238722169] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:00,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:00,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:51:00,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235499247] [2025-01-09 14:51:00,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:00,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:51:00,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:00,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:51:00,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:51:00,493 INFO L87 Difference]: Start difference. First operand 2194 states and 3439 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-01-09 14:51:01,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:01,030 INFO L93 Difference]: Finished difference Result 7170 states and 11162 transitions. [2025-01-09 14:51:01,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:51:01,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 555 [2025-01-09 14:51:01,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:01,051 INFO L225 Difference]: With dead ends: 7170 [2025-01-09 14:51:01,052 INFO L226 Difference]: Without dead ends: 5052 [2025-01-09 14:51:01,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:51:01,057 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 685 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:01,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1647 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:51:01,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5052 states. [2025-01-09 14:51:01,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5052 to 4310. [2025-01-09 14:51:01,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4310 states, 3512 states have (on average 1.4840546697038723) internal successors, (5212), 3533 states have internal predecessors, (5212), 771 states have call successors, (771), 26 states have call predecessors, (771), 26 states have return successors, (771), 750 states have call predecessors, (771), 771 states have call successors, (771) [2025-01-09 14:51:01,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4310 states to 4310 states and 6754 transitions. [2025-01-09 14:51:01,285 INFO L78 Accepts]: Start accepts. Automaton has 4310 states and 6754 transitions. Word has length 555 [2025-01-09 14:51:01,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:01,286 INFO L471 AbstractCegarLoop]: Abstraction has 4310 states and 6754 transitions. [2025-01-09 14:51:01,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-01-09 14:51:01,287 INFO L276 IsEmpty]: Start isEmpty. Operand 4310 states and 6754 transitions. [2025-01-09 14:51:01,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2025-01-09 14:51:01,297 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:01,298 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:01,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:51:01,298 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:01,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:01,299 INFO L85 PathProgramCache]: Analyzing trace with hash 662458793, now seen corresponding path program 1 times [2025-01-09 14:51:01,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:01,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878089682] [2025-01-09 14:51:01,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:01,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:01,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-01-09 14:51:01,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-01-09 14:51:01,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:01,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:01,746 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-01-09 14:51:01,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:01,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878089682] [2025-01-09 14:51:01,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878089682] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:01,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:01,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:51:01,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776830295] [2025-01-09 14:51:01,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:01,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:51:01,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:01,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:51:01,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:51:01,748 INFO L87 Difference]: Start difference. First operand 4310 states and 6754 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-01-09 14:51:02,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:02,138 INFO L93 Difference]: Finished difference Result 12778 states and 20020 transitions. [2025-01-09 14:51:02,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:51:02,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 555 [2025-01-09 14:51:02,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:02,175 INFO L225 Difference]: With dead ends: 12778 [2025-01-09 14:51:02,176 INFO L226 Difference]: Without dead ends: 8544 [2025-01-09 14:51:02,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:51:02,185 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 379 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:02,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1521 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:51:02,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8544 states. [2025-01-09 14:51:02,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8544 to 8542. [2025-01-09 14:51:02,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8542 states, 6992 states have (on average 1.4856979405034325) internal successors, (10388), 7033 states have internal predecessors, (10388), 1497 states have call successors, (1497), 52 states have call predecessors, (1497), 52 states have return successors, (1497), 1456 states have call predecessors, (1497), 1497 states have call successors, (1497) [2025-01-09 14:51:02,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8542 states to 8542 states and 13382 transitions. [2025-01-09 14:51:02,638 INFO L78 Accepts]: Start accepts. Automaton has 8542 states and 13382 transitions. Word has length 555 [2025-01-09 14:51:02,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:02,638 INFO L471 AbstractCegarLoop]: Abstraction has 8542 states and 13382 transitions. [2025-01-09 14:51:02,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-01-09 14:51:02,643 INFO L276 IsEmpty]: Start isEmpty. Operand 8542 states and 13382 transitions. [2025-01-09 14:51:02,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2025-01-09 14:51:02,652 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:02,653 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:02,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:51:02,653 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:02,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:02,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1243944473, now seen corresponding path program 1 times [2025-01-09 14:51:02,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:02,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082728354] [2025-01-09 14:51:02,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:02,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:02,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-01-09 14:51:02,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-01-09 14:51:02,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:02,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:03,678 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-01-09 14:51:03,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:03,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082728354] [2025-01-09 14:51:03,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082728354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:03,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:03,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:51:03,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598222346] [2025-01-09 14:51:03,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:03,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:51:03,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:03,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:51:03,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:51:03,680 INFO L87 Difference]: Start difference. First operand 8542 states and 13382 transitions. Second operand has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-01-09 14:51:06,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:06,310 INFO L93 Difference]: Finished difference Result 33884 states and 52860 transitions. [2025-01-09 14:51:06,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:51:06,311 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 555 [2025-01-09 14:51:06,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:06,402 INFO L225 Difference]: With dead ends: 33884 [2025-01-09 14:51:06,402 INFO L226 Difference]: Without dead ends: 25418 [2025-01-09 14:51:06,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2025-01-09 14:51:06,427 INFO L435 NwaCegarLoop]: 1022 mSDtfsCounter, 2001 mSDsluCounter, 4612 mSDsCounter, 0 mSdLazyCounter, 2483 mSolverCounterSat, 459 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2001 SdHoareTripleChecker+Valid, 5634 SdHoareTripleChecker+Invalid, 2942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 459 IncrementalHoareTripleChecker+Valid, 2483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:06,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2001 Valid, 5634 Invalid, 2942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [459 Valid, 2483 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 14:51:06,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25418 states. [2025-01-09 14:51:07,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25418 to 16882. [2025-01-09 14:51:07,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16882 states, 14010 states have (on average 1.4915060670949323) internal successors, (20896), 14095 states have internal predecessors, (20896), 2769 states have call successors, (2769), 102 states have call predecessors, (2769), 102 states have return successors, (2769), 2684 states have call predecessors, (2769), 2769 states have call successors, (2769) [2025-01-09 14:51:07,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16882 states to 16882 states and 26434 transitions. [2025-01-09 14:51:07,308 INFO L78 Accepts]: Start accepts. Automaton has 16882 states and 26434 transitions. Word has length 555 [2025-01-09 14:51:07,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:07,309 INFO L471 AbstractCegarLoop]: Abstraction has 16882 states and 26434 transitions. [2025-01-09 14:51:07,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.8) internal successors, (168), 10 states have internal predecessors, (168), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-01-09 14:51:07,309 INFO L276 IsEmpty]: Start isEmpty. Operand 16882 states and 26434 transitions. [2025-01-09 14:51:07,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2025-01-09 14:51:07,325 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:07,325 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:07,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:51:07,326 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:07,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:07,327 INFO L85 PathProgramCache]: Analyzing trace with hash -312173418, now seen corresponding path program 1 times [2025-01-09 14:51:07,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:07,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293810949] [2025-01-09 14:51:07,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:07,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:07,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 556 statements into 1 equivalence classes. [2025-01-09 14:51:07,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 556 of 556 statements. [2025-01-09 14:51:07,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:07,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:08,490 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-01-09 14:51:08,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:08,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293810949] [2025-01-09 14:51:08,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293810949] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:08,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:08,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:51:08,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765288517] [2025-01-09 14:51:08,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:08,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:51:08,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:08,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:51:08,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:51:08,494 INFO L87 Difference]: Start difference. First operand 16882 states and 26434 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-01-09 14:51:09,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:09,984 INFO L93 Difference]: Finished difference Result 61972 states and 97065 transitions. [2025-01-09 14:51:09,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:51:09,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 556 [2025-01-09 14:51:09,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:10,103 INFO L225 Difference]: With dead ends: 61972 [2025-01-09 14:51:10,104 INFO L226 Difference]: Without dead ends: 45166 [2025-01-09 14:51:10,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:51:10,138 INFO L435 NwaCegarLoop]: 752 mSDtfsCounter, 673 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 1770 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:10,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 1770 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:51:10,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45166 states. [2025-01-09 14:51:11,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45166 to 33686. [2025-01-09 14:51:11,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33686 states, 27988 states have (on average 1.4792053737315993) internal successors, (41400), 28157 states have internal predecessors, (41400), 5493 states have call successors, (5493), 204 states have call predecessors, (5493), 204 states have return successors, (5493), 5324 states have call predecessors, (5493), 5493 states have call successors, (5493) [2025-01-09 14:51:11,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33686 states to 33686 states and 52386 transitions. [2025-01-09 14:51:11,867 INFO L78 Accepts]: Start accepts. Automaton has 33686 states and 52386 transitions. Word has length 556 [2025-01-09 14:51:11,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:11,869 INFO L471 AbstractCegarLoop]: Abstraction has 33686 states and 52386 transitions. [2025-01-09 14:51:11,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-01-09 14:51:11,869 INFO L276 IsEmpty]: Start isEmpty. Operand 33686 states and 52386 transitions. [2025-01-09 14:51:11,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2025-01-09 14:51:11,904 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:11,904 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:11,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:51:11,904 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:11,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:11,905 INFO L85 PathProgramCache]: Analyzing trace with hash -703608460, now seen corresponding path program 1 times [2025-01-09 14:51:11,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:11,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125063411] [2025-01-09 14:51:11,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:11,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:11,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes. [2025-01-09 14:51:12,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements. [2025-01-09 14:51:12,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:12,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:13,507 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-01-09 14:51:13,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:13,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125063411] [2025-01-09 14:51:13,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125063411] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:13,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:13,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:51:13,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93418177] [2025-01-09 14:51:13,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:13,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:51:13,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:13,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:51:13,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:51:13,510 INFO L87 Difference]: Start difference. First operand 33686 states and 52386 transitions. Second operand has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 2 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 2 states have call predecessors, (78), 2 states have call successors, (78) [2025-01-09 14:51:17,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:17,692 INFO L93 Difference]: Finished difference Result 114042 states and 177041 transitions. [2025-01-09 14:51:17,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:51:17,692 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 2 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 2 states have call predecessors, (78), 2 states have call successors, (78) Word has length 557 [2025-01-09 14:51:17,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:17,941 INFO L225 Difference]: With dead ends: 114042 [2025-01-09 14:51:17,942 INFO L226 Difference]: Without dead ends: 80432 [2025-01-09 14:51:18,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:51:18,019 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 2326 mSDsluCounter, 1825 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 597 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2326 SdHoareTripleChecker+Valid, 2441 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 597 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:18,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2326 Valid, 2441 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [597 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 14:51:18,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80432 states. [2025-01-09 14:51:21,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80432 to 62306. [2025-01-09 14:51:21,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62306 states, 53043 states have (on average 1.4931847746168203) internal successors, (79203), 53356 states have internal predecessors, (79203), 8913 states have call successors, (8913), 349 states have call predecessors, (8913), 349 states have return successors, (8913), 8600 states have call predecessors, (8913), 8913 states have call successors, (8913) [2025-01-09 14:51:21,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62306 states to 62306 states and 97029 transitions. [2025-01-09 14:51:22,073 INFO L78 Accepts]: Start accepts. Automaton has 62306 states and 97029 transitions. Word has length 557 [2025-01-09 14:51:22,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:22,078 INFO L471 AbstractCegarLoop]: Abstraction has 62306 states and 97029 transitions. [2025-01-09 14:51:22,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 2 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 2 states have call predecessors, (78), 2 states have call successors, (78) [2025-01-09 14:51:22,079 INFO L276 IsEmpty]: Start isEmpty. Operand 62306 states and 97029 transitions. [2025-01-09 14:51:22,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2025-01-09 14:51:22,188 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:22,188 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:22,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:51:22,189 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:22,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:22,189 INFO L85 PathProgramCache]: Analyzing trace with hash -676542858, now seen corresponding path program 1 times [2025-01-09 14:51:22,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:22,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873180261] [2025-01-09 14:51:22,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:22,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:22,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes. [2025-01-09 14:51:22,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements. [2025-01-09 14:51:22,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:22,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:23,080 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-01-09 14:51:23,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:23,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873180261] [2025-01-09 14:51:23,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873180261] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:23,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:23,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:51:23,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515691112] [2025-01-09 14:51:23,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:23,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:51:23,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:23,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:51:23,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:51:23,082 INFO L87 Difference]: Start difference. First operand 62306 states and 97029 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-01-09 14:51:25,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:25,535 INFO L93 Difference]: Finished difference Result 156562 states and 242821 transitions. [2025-01-09 14:51:25,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:51:25,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 557 [2025-01-09 14:51:25,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:25,984 INFO L225 Difference]: With dead ends: 156562 [2025-01-09 14:51:25,987 INFO L226 Difference]: Without dead ends: 94336 [2025-01-09 14:51:26,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:51:26,190 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 403 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:26,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1517 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:51:26,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94336 states. [2025-01-09 14:51:29,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94336 to 77702. [2025-01-09 14:51:29,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77702 states, 68405 states have (on average 1.5252247642716175) internal successors, (104333), 68717 states have internal predecessors, (104333), 8946 states have call successors, (8946), 350 states have call predecessors, (8946), 350 states have return successors, (8946), 8634 states have call predecessors, (8946), 8946 states have call successors, (8946) [2025-01-09 14:51:29,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77702 states to 77702 states and 122225 transitions. [2025-01-09 14:51:29,894 INFO L78 Accepts]: Start accepts. Automaton has 77702 states and 122225 transitions. Word has length 557 [2025-01-09 14:51:29,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:29,895 INFO L471 AbstractCegarLoop]: Abstraction has 77702 states and 122225 transitions. [2025-01-09 14:51:29,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-01-09 14:51:29,895 INFO L276 IsEmpty]: Start isEmpty. Operand 77702 states and 122225 transitions. [2025-01-09 14:51:29,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2025-01-09 14:51:29,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:29,931 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:29,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:51:29,931 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:29,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:29,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1132262758, now seen corresponding path program 1 times [2025-01-09 14:51:29,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:29,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823533016] [2025-01-09 14:51:29,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:29,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:29,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 558 statements into 1 equivalence classes. [2025-01-09 14:51:30,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 558 of 558 statements. [2025-01-09 14:51:30,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:30,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:31,404 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-01-09 14:51:31,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:31,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823533016] [2025-01-09 14:51:31,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823533016] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:31,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:31,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:51:31,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563092905] [2025-01-09 14:51:31,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:31,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:51:31,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:31,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:51:31,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:51:31,407 INFO L87 Difference]: Start difference. First operand 77702 states and 122225 transitions. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-01-09 14:51:34,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:34,784 INFO L93 Difference]: Finished difference Result 182420 states and 286593 transitions. [2025-01-09 14:51:34,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:51:34,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 558 [2025-01-09 14:51:34,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:35,095 INFO L225 Difference]: With dead ends: 182420 [2025-01-09 14:51:35,095 INFO L226 Difference]: Without dead ends: 104869 [2025-01-09 14:51:35,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:51:35,197 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 779 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 2103 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:35,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 2103 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:51:35,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104869 states. [2025-01-09 14:51:38,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104869 to 87825. [2025-01-09 14:51:38,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87825 states, 77024 states have (on average 1.5230837141670128) internal successors, (117314), 77376 states have internal predecessors, (117314), 10398 states have call successors, (10398), 402 states have call predecessors, (10398), 402 states have return successors, (10398), 10046 states have call predecessors, (10398), 10398 states have call successors, (10398) [2025-01-09 14:51:39,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87825 states to 87825 states and 138110 transitions. [2025-01-09 14:51:39,085 INFO L78 Accepts]: Start accepts. Automaton has 87825 states and 138110 transitions. Word has length 558 [2025-01-09 14:51:39,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:39,085 INFO L471 AbstractCegarLoop]: Abstraction has 87825 states and 138110 transitions. [2025-01-09 14:51:39,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-01-09 14:51:39,087 INFO L276 IsEmpty]: Start isEmpty. Operand 87825 states and 138110 transitions. [2025-01-09 14:51:39,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2025-01-09 14:51:39,128 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:39,128 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:39,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:51:39,130 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:39,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:39,131 INFO L85 PathProgramCache]: Analyzing trace with hash -927102054, now seen corresponding path program 1 times [2025-01-09 14:51:39,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:39,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256616806] [2025-01-09 14:51:39,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:39,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:39,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 558 statements into 1 equivalence classes. [2025-01-09 14:51:39,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 558 of 558 statements. [2025-01-09 14:51:39,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:39,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:39,722 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-01-09 14:51:39,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:39,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256616806] [2025-01-09 14:51:39,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256616806] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:39,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:39,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:51:39,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293729145] [2025-01-09 14:51:39,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:39,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:51:39,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:39,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:51:39,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:51:39,724 INFO L87 Difference]: Start difference. First operand 87825 states and 138110 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-01-09 14:51:42,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:42,513 INFO L93 Difference]: Finished difference Result 165679 states and 259931 transitions. [2025-01-09 14:51:42,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:51:42,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 558 [2025-01-09 14:51:42,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:42,784 INFO L225 Difference]: With dead ends: 165679 [2025-01-09 14:51:42,784 INFO L226 Difference]: Without dead ends: 80489 [2025-01-09 14:51:42,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:51:42,882 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 0 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:42,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1043 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:51:42,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80489 states. [2025-01-09 14:51:46,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80489 to 80489. [2025-01-09 14:51:46,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80489 states, 69688 states have (on average 1.5084663069682012) internal successors, (105122), 70040 states have internal predecessors, (105122), 10398 states have call successors, (10398), 402 states have call predecessors, (10398), 402 states have return successors, (10398), 10046 states have call predecessors, (10398), 10398 states have call successors, (10398) [2025-01-09 14:51:47,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80489 states to 80489 states and 125918 transitions. [2025-01-09 14:51:47,061 INFO L78 Accepts]: Start accepts. Automaton has 80489 states and 125918 transitions. Word has length 558 [2025-01-09 14:51:47,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:47,062 INFO L471 AbstractCegarLoop]: Abstraction has 80489 states and 125918 transitions. [2025-01-09 14:51:47,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-01-09 14:51:47,062 INFO L276 IsEmpty]: Start isEmpty. Operand 80489 states and 125918 transitions. [2025-01-09 14:51:47,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2025-01-09 14:51:47,107 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:47,108 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:47,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:51:47,108 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:47,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:47,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1680070963, now seen corresponding path program 1 times [2025-01-09 14:51:47,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:47,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083990692] [2025-01-09 14:51:47,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:47,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:47,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 558 statements into 1 equivalence classes. [2025-01-09 14:51:47,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 558 of 558 statements. [2025-01-09 14:51:47,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:47,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:48,912 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-01-09 14:51:48,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:48,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083990692] [2025-01-09 14:51:48,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083990692] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:48,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:48,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 14:51:48,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147849134] [2025-01-09 14:51:48,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:48,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 14:51:48,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:48,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 14:51:48,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2025-01-09 14:51:48,914 INFO L87 Difference]: Start difference. First operand 80489 states and 125918 transitions. Second operand has 16 states, 16 states have (on average 10.6875) internal successors, (171), 16 states have internal predecessors, (171), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-01-09 14:52:00,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:00,961 INFO L93 Difference]: Finished difference Result 227735 states and 356765 transitions. [2025-01-09 14:52:00,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-01-09 14:52:00,962 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.6875) internal successors, (171), 16 states have internal predecessors, (171), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) Word has length 558 [2025-01-09 14:52:00,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:01,492 INFO L225 Difference]: With dead ends: 227735 [2025-01-09 14:52:01,493 INFO L226 Difference]: Without dead ends: 218429 [2025-01-09 14:52:01,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=479, Invalid=1591, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 14:52:01,584 INFO L435 NwaCegarLoop]: 1349 mSDtfsCounter, 8031 mSDsluCounter, 9434 mSDsCounter, 0 mSdLazyCounter, 4466 mSolverCounterSat, 965 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8031 SdHoareTripleChecker+Valid, 10783 SdHoareTripleChecker+Invalid, 5431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 965 IncrementalHoareTripleChecker+Valid, 4466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:01,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8031 Valid, 10783 Invalid, 5431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [965 Valid, 4466 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 14:52:01,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218429 states. [2025-01-09 14:52:06,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218429 to 101781. [2025-01-09 14:52:06,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101781 states, 88628 states have (on average 1.5119601029020173) internal successors, (134002), 89076 states have internal predecessors, (134002), 12654 states have call successors, (12654), 498 states have call predecessors, (12654), 498 states have return successors, (12654), 12206 states have call predecessors, (12654), 12654 states have call successors, (12654) [2025-01-09 14:52:07,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101781 states to 101781 states and 159310 transitions. [2025-01-09 14:52:07,126 INFO L78 Accepts]: Start accepts. Automaton has 101781 states and 159310 transitions. Word has length 558 [2025-01-09 14:52:07,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:07,127 INFO L471 AbstractCegarLoop]: Abstraction has 101781 states and 159310 transitions. [2025-01-09 14:52:07,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.6875) internal successors, (171), 16 states have internal predecessors, (171), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78) [2025-01-09 14:52:07,127 INFO L276 IsEmpty]: Start isEmpty. Operand 101781 states and 159310 transitions. [2025-01-09 14:52:07,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2025-01-09 14:52:07,173 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:07,174 INFO L218 NwaCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:07,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:52:07,175 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:07,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:07,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1332516334, now seen corresponding path program 1 times [2025-01-09 14:52:07,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:07,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222389589] [2025-01-09 14:52:07,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:07,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:07,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 559 statements into 1 equivalence classes. [2025-01-09 14:52:07,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 559 of 559 statements. [2025-01-09 14:52:07,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:07,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:07,344 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12012 trivial. 0 not checked. [2025-01-09 14:52:07,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:07,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222389589] [2025-01-09 14:52:07,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222389589] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:07,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:07,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:52:07,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759679902] [2025-01-09 14:52:07,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:07,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:52:07,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:07,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:52:07,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:52:07,346 INFO L87 Difference]: Start difference. First operand 101781 states and 159310 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 1 states have call predecessors, (78), 1 states have call successors, (78)