./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-24.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-24.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 107d0e452e5595f1deab9eb0bc24a94452bda82a0a15c0d1f255f44e041f3176 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:44:38,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:44:38,940 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:44:38,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:44:38,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:44:38,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:44:38,977 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:44:38,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:44:38,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:44:38,978 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:44:38,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:44:38,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:44:38,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:44:38,985 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:44:38,986 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:44:38,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:44:38,986 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:44:38,986 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:44:38,986 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:44:38,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:44:38,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:44:38,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:44:38,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:44:38,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:44:38,987 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:44:38,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:44:38,987 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:44:38,987 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:44:38,987 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:44:38,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:44:38,987 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:44:38,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:44:38,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:44:38,988 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:44:38,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:44:38,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:44:38,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:44:38,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:44:38,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:44:38,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:44:38,989 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:44:38,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:44:38,989 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:44:38,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:44:38,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:44:38,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:44:38,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:44:38,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:44:38,989 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 -> 107d0e452e5595f1deab9eb0bc24a94452bda82a0a15c0d1f255f44e041f3176 [2025-01-09 14:44:39,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:44:39,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:44:39,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:44:39,265 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:44:39,265 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:44:39,266 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-24.i [2025-01-09 14:44:40,477 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54caf4005/b1c7f1153888467396e6bbe14895f86a/FLAGd6c3df7d2 [2025-01-09 14:44:40,846 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:44:40,848 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-24.i [2025-01-09 14:44:40,863 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54caf4005/b1c7f1153888467396e6bbe14895f86a/FLAGd6c3df7d2 [2025-01-09 14:44:41,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54caf4005/b1c7f1153888467396e6bbe14895f86a [2025-01-09 14:44:41,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:44:41,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:44:41,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:44:41,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:44:41,083 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:44:41,084 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:44:41" (1/1) ... [2025-01-09 14:44:41,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf12a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:41, skipping insertion in model container [2025-01-09 14:44:41,086 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:44:41" (1/1) ... [2025-01-09 14:44:41,116 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:44:41,213 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-24.i[916,929] [2025-01-09 14:44:41,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:44:41,357 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:44:41,366 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-24.i[916,929] [2025-01-09 14:44:41,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:44:41,509 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:44:41,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:41 WrapperNode [2025-01-09 14:44:41,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:44:41,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:44:41,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:44:41,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:44:41,516 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:44:41" (1/1) ... [2025-01-09 14:44:41,534 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:44:41" (1/1) ... [2025-01-09 14:44:41,619 INFO L138 Inliner]: procedures = 26, calls = 93, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 899 [2025-01-09 14:44:41,620 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:44:41,620 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:44:41,620 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:44:41,621 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:44:41,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:41" (1/1) ... [2025-01-09 14:44:41,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:41" (1/1) ... [2025-01-09 14:44:41,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:41" (1/1) ... [2025-01-09 14:44:41,743 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:44:41,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:41" (1/1) ... [2025-01-09 14:44:41,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:41" (1/1) ... [2025-01-09 14:44:41,764 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:41" (1/1) ... [2025-01-09 14:44:41,768 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:41" (1/1) ... [2025-01-09 14:44:41,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:41" (1/1) ... [2025-01-09 14:44:41,782 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:41" (1/1) ... [2025-01-09 14:44:41,789 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:41" (1/1) ... [2025-01-09 14:44:41,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:44:41,806 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:44:41,806 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:44:41,806 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:44:41,807 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:41" (1/1) ... [2025-01-09 14:44:41,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:44:41,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:44:41,832 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:44:41,846 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:44:41,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:44:41,861 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:44:41,861 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:44:41,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:44:41,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:44:41,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:44:41,966 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:44:41,967 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:44:43,159 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2025-01-09 14:44:43,159 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:44:43,185 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:44:43,185 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:44:43,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:44:43 BoogieIcfgContainer [2025-01-09 14:44:43,186 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:44:43,188 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:44:43,188 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:44:43,191 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:44:43,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:44:41" (1/3) ... [2025-01-09 14:44:43,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a1484d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:44:43, skipping insertion in model container [2025-01-09 14:44:43,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:41" (2/3) ... [2025-01-09 14:44:43,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a1484d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:44:43, skipping insertion in model container [2025-01-09 14:44:43,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:44:43" (3/3) ... [2025-01-09 14:44:43,193 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-24.i [2025-01-09 14:44:43,207 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:44:43,209 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-24.i that has 2 procedures, 365 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:44:43,246 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:44:43,253 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;@1079c44d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:44:43,254 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:44:43,257 INFO L276 IsEmpty]: Start isEmpty. Operand has 365 states, 282 states have (on average 1.5390070921985815) internal successors, (434), 283 states have internal predecessors, (434), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 14:44:43,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-01-09 14:44:43,274 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:43,275 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:43,275 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:43,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:43,279 INFO L85 PathProgramCache]: Analyzing trace with hash 560257628, now seen corresponding path program 1 times [2025-01-09 14:44:43,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:43,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318029721] [2025-01-09 14:44:43,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:43,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:43,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-01-09 14:44:43,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-01-09 14:44:43,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:43,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:43,867 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 158 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2025-01-09 14:44:43,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:43,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318029721] [2025-01-09 14:44:43,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318029721] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:44:43,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643089078] [2025-01-09 14:44:43,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:43,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:44:43,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:44:43,871 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:44:43,872 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:44:44,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-01-09 14:44:44,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-01-09 14:44:44,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:44,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:44,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 1314 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:44:44,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:44:44,259 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2025-01-09 14:44:44,259 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:44:44,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643089078] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:44,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:44:44,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:44:44,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158637071] [2025-01-09 14:44:44,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:44,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:44:44,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:44,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:44:44,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:44:44,281 INFO L87 Difference]: Start difference. First operand has 365 states, 282 states have (on average 1.5390070921985815) internal successors, (434), 283 states have internal predecessors, (434), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) Second operand has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) [2025-01-09 14:44:44,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:44,326 INFO L93 Difference]: Finished difference Result 724 states and 1263 transitions. [2025-01-09 14:44:44,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:44:44,328 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) Word has length 545 [2025-01-09 14:44:44,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:44,340 INFO L225 Difference]: With dead ends: 724 [2025-01-09 14:44:44,340 INFO L226 Difference]: Without dead ends: 362 [2025-01-09 14:44:44,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 546 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:44:44,346 INFO L435 NwaCegarLoop]: 589 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, 589 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:44:44,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:44:44,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-01-09 14:44:44,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2025-01-09 14:44:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 280 states have (on average 1.5321428571428573) internal successors, (429), 280 states have internal predecessors, (429), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 14:44:44,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 589 transitions. [2025-01-09 14:44:44,415 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 589 transitions. Word has length 545 [2025-01-09 14:44:44,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:44,415 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 589 transitions. [2025-01-09 14:44:44,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) [2025-01-09 14:44:44,416 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 589 transitions. [2025-01-09 14:44:44,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-01-09 14:44:44,422 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:44,426 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:44,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:44:44,631 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:44:44,631 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:44,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:44,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1747757908, now seen corresponding path program 1 times [2025-01-09 14:44:44,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:44,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999172291] [2025-01-09 14:44:44,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:44,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:44,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-01-09 14:44:44,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-01-09 14:44:44,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:44,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:45,269 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 14:44:45,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:45,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999172291] [2025-01-09 14:44:45,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999172291] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:45,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:45,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:44:45,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973704430] [2025-01-09 14:44:45,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:45,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:44:45,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:45,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:44:45,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:44:45,273 INFO L87 Difference]: Start difference. First operand 362 states and 589 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:44:45,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:45,428 INFO L93 Difference]: Finished difference Result 1074 states and 1749 transitions. [2025-01-09 14:44:45,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:44:45,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 545 [2025-01-09 14:44:45,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:45,437 INFO L225 Difference]: With dead ends: 1074 [2025-01-09 14:44:45,442 INFO L226 Difference]: Without dead ends: 715 [2025-01-09 14:44:45,443 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:44:45,444 INFO L435 NwaCegarLoop]: 1094 mSDtfsCounter, 550 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:45,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 1655 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:44:45,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2025-01-09 14:44:45,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 713. [2025-01-09 14:44:45,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 550 states have (on average 1.52) internal successors, (836), 550 states have internal predecessors, (836), 160 states have call successors, (160), 2 states have call predecessors, (160), 2 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2025-01-09 14:44:45,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1156 transitions. [2025-01-09 14:44:45,565 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1156 transitions. Word has length 545 [2025-01-09 14:44:45,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:45,569 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 1156 transitions. [2025-01-09 14:44:45,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:44:45,569 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1156 transitions. [2025-01-09 14:44:45,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-01-09 14:44:45,580 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:45,580 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:45,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:44:45,580 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:45,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:45,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1161481686, now seen corresponding path program 1 times [2025-01-09 14:44:45,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:45,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756429271] [2025-01-09 14:44:45,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:45,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:45,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-01-09 14:44:45,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-01-09 14:44:45,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:45,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:46,061 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 14:44:46,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:46,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756429271] [2025-01-09 14:44:46,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756429271] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:46,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:46,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:44:46,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568384819] [2025-01-09 14:44:46,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:46,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:44:46,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:46,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:44:46,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:44:46,067 INFO L87 Difference]: Start difference. First operand 713 states and 1156 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:44:46,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:46,213 INFO L93 Difference]: Finished difference Result 2133 states and 3462 transitions. [2025-01-09 14:44:46,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:44:46,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 545 [2025-01-09 14:44:46,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:46,227 INFO L225 Difference]: With dead ends: 2133 [2025-01-09 14:44:46,227 INFO L226 Difference]: Without dead ends: 1423 [2025-01-09 14:44:46,230 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:44:46,232 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 580 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:46,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 1149 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:44:46,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2025-01-09 14:44:46,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1421. [2025-01-09 14:44:46,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1421 states, 1096 states have (on average 1.5164233576642336) internal successors, (1662), 1096 states have internal predecessors, (1662), 320 states have call successors, (320), 4 states have call predecessors, (320), 4 states have return successors, (320), 320 states have call predecessors, (320), 320 states have call successors, (320) [2025-01-09 14:44:46,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 2302 transitions. [2025-01-09 14:44:46,368 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 2302 transitions. Word has length 545 [2025-01-09 14:44:46,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:46,371 INFO L471 AbstractCegarLoop]: Abstraction has 1421 states and 2302 transitions. [2025-01-09 14:44:46,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:44:46,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 2302 transitions. [2025-01-09 14:44:46,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-01-09 14:44:46,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:46,382 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:46,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:44:46,382 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:46,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:46,383 INFO L85 PathProgramCache]: Analyzing trace with hash 2058874964, now seen corresponding path program 1 times [2025-01-09 14:44:46,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:46,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833234012] [2025-01-09 14:44:46,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:46,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:46,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-01-09 14:44:47,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-01-09 14:44:47,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:47,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:48,278 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 14:44:48,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:48,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833234012] [2025-01-09 14:44:48,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833234012] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:48,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:48,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:44:48,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550981803] [2025-01-09 14:44:48,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:48,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:44:48,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:48,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:44:48,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:44:48,281 INFO L87 Difference]: Start difference. First operand 1421 states and 2302 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:44:48,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:48,926 INFO L93 Difference]: Finished difference Result 6407 states and 10341 transitions. [2025-01-09 14:44:48,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:44:48,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 545 [2025-01-09 14:44:48,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:48,956 INFO L225 Difference]: With dead ends: 6407 [2025-01-09 14:44:48,956 INFO L226 Difference]: Without dead ends: 4989 [2025-01-09 14:44:48,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:44:48,964 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 1751 mSDsluCounter, 2416 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1751 SdHoareTripleChecker+Valid, 2989 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:48,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1751 Valid, 2989 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:44:48,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4989 states. [2025-01-09 14:44:49,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4989 to 3097. [2025-01-09 14:44:49,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3097 states, 2584 states have (on average 1.5445046439628483) internal successors, (3991), 2588 states have internal predecessors, (3991), 504 states have call successors, (504), 8 states have call predecessors, (504), 8 states have return successors, (504), 500 states have call predecessors, (504), 504 states have call successors, (504) [2025-01-09 14:44:49,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3097 states to 3097 states and 4999 transitions. [2025-01-09 14:44:49,215 INFO L78 Accepts]: Start accepts. Automaton has 3097 states and 4999 transitions. Word has length 545 [2025-01-09 14:44:49,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:49,215 INFO L471 AbstractCegarLoop]: Abstraction has 3097 states and 4999 transitions. [2025-01-09 14:44:49,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:44:49,216 INFO L276 IsEmpty]: Start isEmpty. Operand 3097 states and 4999 transitions. [2025-01-09 14:44:49,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-01-09 14:44:49,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:49,224 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:49,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:44:49,224 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:49,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:49,225 INFO L85 PathProgramCache]: Analyzing trace with hash 973957458, now seen corresponding path program 1 times [2025-01-09 14:44:49,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:49,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833431224] [2025-01-09 14:44:49,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:49,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:49,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-01-09 14:44:50,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-01-09 14:44:50,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:50,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:01,858 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 14:45:01,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:01,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833431224] [2025-01-09 14:45:01,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833431224] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:01,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:01,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2025-01-09 14:45:01,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356193693] [2025-01-09 14:45:01,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:01,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 14:45:01,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:01,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 14:45:01,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2025-01-09 14:45:01,862 INFO L87 Difference]: Start difference. First operand 3097 states and 4999 transitions. Second operand has 27 states, 27 states have (on average 5.481481481481482) internal successors, (148), 27 states have internal predecessors, (148), 7 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 7 states have call predecessors, (80), 7 states have call successors, (80) [2025-01-09 14:45:41,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:41,240 INFO L93 Difference]: Finished difference Result 19284 states and 30584 transitions. [2025-01-09 14:45:41,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 14:45:41,241 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.481481481481482) internal successors, (148), 27 states have internal predecessors, (148), 7 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 7 states have call predecessors, (80), 7 states have call successors, (80) Word has length 545 [2025-01-09 14:45:41,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:41,296 INFO L225 Difference]: With dead ends: 19284 [2025-01-09 14:45:41,296 INFO L226 Difference]: Without dead ends: 16190 [2025-01-09 14:45:41,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=462, Invalid=1700, Unknown=0, NotChecked=0, Total=2162 [2025-01-09 14:45:41,307 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 15397 mSDsluCounter, 7845 mSDsCounter, 0 mSdLazyCounter, 7468 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15397 SdHoareTripleChecker+Valid, 8403 SdHoareTripleChecker+Invalid, 7981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 7468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:41,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15397 Valid, 8403 Invalid, 7981 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [513 Valid, 7468 Invalid, 0 Unknown, 0 Unchecked, 25.7s Time] [2025-01-09 14:45:41,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16190 states. [2025-01-09 14:45:41,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16190 to 3718. [2025-01-09 14:45:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3718 states, 3122 states have (on average 1.5474055092889174) internal successors, (4831), 3126 states have internal predecessors, (4831), 584 states have call successors, (584), 11 states have call predecessors, (584), 11 states have return successors, (584), 580 states have call predecessors, (584), 584 states have call successors, (584) [2025-01-09 14:45:41,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3718 states to 3718 states and 5999 transitions. [2025-01-09 14:45:41,590 INFO L78 Accepts]: Start accepts. Automaton has 3718 states and 5999 transitions. Word has length 545 [2025-01-09 14:45:41,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:41,592 INFO L471 AbstractCegarLoop]: Abstraction has 3718 states and 5999 transitions. [2025-01-09 14:45:41,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.481481481481482) internal successors, (148), 27 states have internal predecessors, (148), 7 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 7 states have call predecessors, (80), 7 states have call successors, (80) [2025-01-09 14:45:41,594 INFO L276 IsEmpty]: Start isEmpty. Operand 3718 states and 5999 transitions. [2025-01-09 14:45:41,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-01-09 14:45:41,628 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:41,628 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:41,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:45:41,628 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:41,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:41,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1675557332, now seen corresponding path program 1 times [2025-01-09 14:45:41,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:41,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420360626] [2025-01-09 14:45:41,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:41,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:41,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-01-09 14:45:41,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-01-09 14:45:41,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:41,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:42,593 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 14:45:42,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:42,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420360626] [2025-01-09 14:45:42,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420360626] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:42,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:42,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:45:42,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871404189] [2025-01-09 14:45:42,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:42,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:45:42,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:42,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:45:42,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:45:42,596 INFO L87 Difference]: Start difference. First operand 3718 states and 5999 transitions. Second operand has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 states have internal predecessors, (148), 3 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 3 states have call predecessors, (80), 3 states have call successors, (80) [2025-01-09 14:45:44,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:44,417 INFO L93 Difference]: Finished difference Result 11392 states and 18293 transitions. [2025-01-09 14:45:44,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:45:44,418 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 states have internal predecessors, (148), 3 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 3 states have call predecessors, (80), 3 states have call successors, (80) Word has length 545 [2025-01-09 14:45:44,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:44,441 INFO L225 Difference]: With dead ends: 11392 [2025-01-09 14:45:44,441 INFO L226 Difference]: Without dead ends: 8298 [2025-01-09 14:45:44,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:45:44,479 INFO L435 NwaCegarLoop]: 956 mSDtfsCounter, 1185 mSDsluCounter, 4557 mSDsCounter, 0 mSdLazyCounter, 1601 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 5513 SdHoareTripleChecker+Invalid, 1912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 1601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:44,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 5513 Invalid, 1912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1601 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 14:45:44,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8298 states. [2025-01-09 14:45:44,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8298 to 4675. [2025-01-09 14:45:44,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4675 states, 4079 states have (on average 1.5768570728119637) internal successors, (6432), 4083 states have internal predecessors, (6432), 584 states have call successors, (584), 11 states have call predecessors, (584), 11 states have return successors, (584), 580 states have call predecessors, (584), 584 states have call successors, (584) [2025-01-09 14:45:44,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4675 states to 4675 states and 7600 transitions. [2025-01-09 14:45:44,968 INFO L78 Accepts]: Start accepts. Automaton has 4675 states and 7600 transitions. Word has length 545 [2025-01-09 14:45:44,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:44,974 INFO L471 AbstractCegarLoop]: Abstraction has 4675 states and 7600 transitions. [2025-01-09 14:45:44,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 states have internal predecessors, (148), 3 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 3 states have call predecessors, (80), 3 states have call successors, (80) [2025-01-09 14:45:44,974 INFO L276 IsEmpty]: Start isEmpty. Operand 4675 states and 7600 transitions. [2025-01-09 14:45:44,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-01-09 14:45:44,990 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:44,991 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:44,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:45:44,992 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:44,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:44,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1079337324, now seen corresponding path program 1 times [2025-01-09 14:45:44,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:44,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145919610] [2025-01-09 14:45:44,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:44,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:45,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-01-09 14:45:45,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-01-09 14:45:45,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:45,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:45,419 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 14:45:45,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:45,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145919610] [2025-01-09 14:45:45,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145919610] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:45,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:45,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:45:45,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433675167] [2025-01-09 14:45:45,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:45,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:45:45,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:45,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:45:45,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:45:45,421 INFO L87 Difference]: Start difference. First operand 4675 states and 7600 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:45:45,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:45,655 INFO L93 Difference]: Finished difference Result 11493 states and 18649 transitions. [2025-01-09 14:45:45,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:45:45,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 545 [2025-01-09 14:45:45,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:45,682 INFO L225 Difference]: With dead ends: 11493 [2025-01-09 14:45:45,683 INFO L226 Difference]: Without dead ends: 8091 [2025-01-09 14:45:45,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:45:45,693 INFO L435 NwaCegarLoop]: 788 mSDtfsCounter, 388 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:45,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1340 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:45:45,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8091 states. [2025-01-09 14:45:46,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8091 to 8075. [2025-01-09 14:45:46,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8075 states, 6967 states have (on average 1.562508970862638) internal successors, (10886), 6975 states have internal predecessors, (10886), 1088 states have call successors, (1088), 19 states have call predecessors, (1088), 19 states have return successors, (1088), 1080 states have call predecessors, (1088), 1088 states have call successors, (1088) [2025-01-09 14:45:46,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8075 states to 8075 states and 13062 transitions. [2025-01-09 14:45:46,275 INFO L78 Accepts]: Start accepts. Automaton has 8075 states and 13062 transitions. Word has length 545 [2025-01-09 14:45:46,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:46,276 INFO L471 AbstractCegarLoop]: Abstraction has 8075 states and 13062 transitions. [2025-01-09 14:45:46,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:45:46,279 INFO L276 IsEmpty]: Start isEmpty. Operand 8075 states and 13062 transitions. [2025-01-09 14:45:46,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-01-09 14:45:46,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:46,292 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:46,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:45:46,293 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:46,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:46,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1812991120, now seen corresponding path program 1 times [2025-01-09 14:45:46,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:46,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369919352] [2025-01-09 14:45:46,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:46,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:46,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-01-09 14:45:47,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-01-09 14:45:47,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:47,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:49,481 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 14:45:49,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:49,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369919352] [2025-01-09 14:45:49,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369919352] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:49,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:49,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 14:45:49,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574988990] [2025-01-09 14:45:49,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:49,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 14:45:49,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:49,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 14:45:49,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:45:49,483 INFO L87 Difference]: Start difference. First operand 8075 states and 13062 transitions. Second operand has 17 states, 17 states have (on average 8.705882352941176) internal successors, (148), 17 states have internal predecessors, (148), 4 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 4 states have call predecessors, (80), 4 states have call successors, (80) [2025-01-09 14:45:58,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:58,075 INFO L93 Difference]: Finished difference Result 23009 states and 36680 transitions. [2025-01-09 14:45:58,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 14:45:58,079 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.705882352941176) internal successors, (148), 17 states have internal predecessors, (148), 4 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 4 states have call predecessors, (80), 4 states have call successors, (80) Word has length 545 [2025-01-09 14:45:58,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:58,125 INFO L225 Difference]: With dead ends: 23009 [2025-01-09 14:45:58,125 INFO L226 Difference]: Without dead ends: 19915 [2025-01-09 14:45:58,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2025-01-09 14:45:58,138 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 4903 mSDsluCounter, 8066 mSDsCounter, 0 mSdLazyCounter, 6003 mSolverCounterSat, 435 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4903 SdHoareTripleChecker+Valid, 8946 SdHoareTripleChecker+Invalid, 6438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 435 IncrementalHoareTripleChecker+Valid, 6003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:58,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4903 Valid, 8946 Invalid, 6438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [435 Valid, 6003 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2025-01-09 14:45:58,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19915 states. [2025-01-09 14:45:58,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19915 to 8361. [2025-01-09 14:45:58,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8361 states, 7253 states have (on average 1.565421205018613) internal successors, (11354), 7261 states have internal predecessors, (11354), 1088 states have call successors, (1088), 19 states have call predecessors, (1088), 19 states have return successors, (1088), 1080 states have call predecessors, (1088), 1088 states have call successors, (1088) [2025-01-09 14:45:58,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8361 states to 8361 states and 13530 transitions. [2025-01-09 14:45:58,627 INFO L78 Accepts]: Start accepts. Automaton has 8361 states and 13530 transitions. Word has length 545 [2025-01-09 14:45:58,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:58,630 INFO L471 AbstractCegarLoop]: Abstraction has 8361 states and 13530 transitions. [2025-01-09 14:45:58,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.705882352941176) internal successors, (148), 17 states have internal predecessors, (148), 4 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 4 states have call predecessors, (80), 4 states have call successors, (80) [2025-01-09 14:45:58,631 INFO L276 IsEmpty]: Start isEmpty. Operand 8361 states and 13530 transitions. [2025-01-09 14:45:58,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-01-09 14:45:58,640 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:58,640 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:58,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:45:58,641 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:58,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:58,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1064181266, now seen corresponding path program 1 times [2025-01-09 14:45:58,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:58,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076838140] [2025-01-09 14:45:58,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:58,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:58,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-01-09 14:45:58,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-01-09 14:45:58,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:58,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:59,392 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 14:45:59,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:59,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076838140] [2025-01-09 14:45:59,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076838140] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:59,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:59,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:45:59,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310800098] [2025-01-09 14:45:59,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:59,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:45:59,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:59,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:45:59,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:45:59,397 INFO L87 Difference]: Start difference. First operand 8361 states and 13530 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:46:00,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:00,490 INFO L93 Difference]: Finished difference Result 28325 states and 45588 transitions. [2025-01-09 14:46:00,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:46:00,491 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 545 [2025-01-09 14:46:00,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:00,544 INFO L225 Difference]: With dead ends: 28325 [2025-01-09 14:46:00,545 INFO L226 Difference]: Without dead ends: 20743 [2025-01-09 14:46:00,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:46:00,559 INFO L435 NwaCegarLoop]: 1142 mSDtfsCounter, 1417 mSDsluCounter, 3040 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1417 SdHoareTripleChecker+Valid, 4182 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:00,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1417 Valid, 4182 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:46:00,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20743 states. [2025-01-09 14:46:00,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20743 to 10348. [2025-01-09 14:46:00,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10348 states, 9608 states have (on average 1.6004371357202332) internal successors, (15377), 9608 states have internal predecessors, (15377), 720 states have call successors, (720), 19 states have call predecessors, (720), 19 states have return successors, (720), 720 states have call predecessors, (720), 720 states have call successors, (720) [2025-01-09 14:46:01,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10348 states to 10348 states and 16817 transitions. [2025-01-09 14:46:01,023 INFO L78 Accepts]: Start accepts. Automaton has 10348 states and 16817 transitions. Word has length 545 [2025-01-09 14:46:01,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:01,025 INFO L471 AbstractCegarLoop]: Abstraction has 10348 states and 16817 transitions. [2025-01-09 14:46:01,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:46:01,026 INFO L276 IsEmpty]: Start isEmpty. Operand 10348 states and 16817 transitions. [2025-01-09 14:46:01,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-01-09 14:46:01,036 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:01,036 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:01,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:46:01,036 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:01,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:01,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1443946608, now seen corresponding path program 1 times [2025-01-09 14:46:01,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:01,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090932306] [2025-01-09 14:46:01,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:01,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:01,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-01-09 14:46:01,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-01-09 14:46:01,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:01,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:01,906 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 14:46:01,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:01,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090932306] [2025-01-09 14:46:01,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090932306] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:01,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:01,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:46:01,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953233568] [2025-01-09 14:46:01,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:01,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:46:01,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:01,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:46:01,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:46:01,908 INFO L87 Difference]: Start difference. First operand 10348 states and 16817 transitions. Second operand has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 2 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) [2025-01-09 14:46:04,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:04,248 INFO L93 Difference]: Finished difference Result 29431 states and 47356 transitions. [2025-01-09 14:46:04,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:46:04,249 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 2 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) Word has length 545 [2025-01-09 14:46:04,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:04,307 INFO L225 Difference]: With dead ends: 29431 [2025-01-09 14:46:04,307 INFO L226 Difference]: Without dead ends: 25909 [2025-01-09 14:46:04,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:46:04,324 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 2975 mSDsluCounter, 2361 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2975 SdHoareTripleChecker+Valid, 3229 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:04,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2975 Valid, 3229 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 14:46:04,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25909 states. [2025-01-09 14:46:05,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25909 to 23051. [2025-01-09 14:46:05,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23051 states, 21517 states have (on average 1.590509829437189) internal successors, (34223), 21525 states have internal predecessors, (34223), 1488 states have call successors, (1488), 45 states have call predecessors, (1488), 45 states have return successors, (1488), 1480 states have call predecessors, (1488), 1488 states have call successors, (1488) [2025-01-09 14:46:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23051 states to 23051 states and 37199 transitions. [2025-01-09 14:46:05,221 INFO L78 Accepts]: Start accepts. Automaton has 23051 states and 37199 transitions. Word has length 545 [2025-01-09 14:46:05,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:05,222 INFO L471 AbstractCegarLoop]: Abstraction has 23051 states and 37199 transitions. [2025-01-09 14:46:05,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 2 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) [2025-01-09 14:46:05,222 INFO L276 IsEmpty]: Start isEmpty. Operand 23051 states and 37199 transitions. [2025-01-09 14:46:05,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-01-09 14:46:05,240 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:05,240 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:05,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:46:05,240 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:05,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:05,241 INFO L85 PathProgramCache]: Analyzing trace with hash 719882322, now seen corresponding path program 1 times [2025-01-09 14:46:05,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:05,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202524396] [2025-01-09 14:46:05,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:05,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:05,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-01-09 14:46:05,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-01-09 14:46:05,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:05,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat