./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-63.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 577634e4ca5e5062d04a888d1f269694da9d1fc5e92895960c37cfcca177a593 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:09:44,934 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:09:44,996 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:09:45,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:09:45,004 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:09:45,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:09:45,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:09:45,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:09:45,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:09:45,023 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:09:45,023 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:09:45,023 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:09:45,024 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:09:45,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:09:45,024 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:09:45,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:09:45,024 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:09:45,024 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:09:45,024 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:09:45,024 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:09:45,025 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:09:45,025 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:09:45,025 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:09:45,025 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:09:45,025 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:09:45,025 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:09:45,025 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:09:45,025 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:09:45,025 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:09:45,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:09:45,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:09:45,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:09:45,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:09:45,026 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:09:45,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:09:45,026 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:09:45,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:09:45,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:09:45,026 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:09:45,026 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:09:45,026 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:09:45,026 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:09:45,026 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:09:45,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:09:45,026 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:09:45,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:09:45,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:09:45,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:09:45,026 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 -> 577634e4ca5e5062d04a888d1f269694da9d1fc5e92895960c37cfcca177a593 [2025-01-09 14:09:45,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:09:45,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:09:45,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:09:45,275 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:09:45,275 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:09:45,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-63.i [2025-01-09 14:09:46,489 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/754f8252d/b0a81ad631ce4f0b84d1a135d204f443/FLAGe1eae5f22 [2025-01-09 14:09:46,761 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:09:46,768 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-63.i [2025-01-09 14:09:46,778 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/754f8252d/b0a81ad631ce4f0b84d1a135d204f443/FLAGe1eae5f22 [2025-01-09 14:09:47,067 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/754f8252d/b0a81ad631ce4f0b84d1a135d204f443 [2025-01-09 14:09:47,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:09:47,070 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:09:47,072 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:09:47,072 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:09:47,075 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:09:47,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:09:47" (1/1) ... [2025-01-09 14:09:47,076 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44a66a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:09:47, skipping insertion in model container [2025-01-09 14:09:47,076 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:09:47" (1/1) ... [2025-01-09 14:09:47,090 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:09:47,197 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_amount100_file-63.i[916,929] [2025-01-09 14:09:47,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:09:47,290 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:09:47,300 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_amount100_file-63.i[916,929] [2025-01-09 14:09:47,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:09:47,351 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:09:47,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:09:47 WrapperNode [2025-01-09 14:09:47,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:09:47,357 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:09:47,357 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:09:47,357 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:09:47,362 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:09:47" (1/1) ... [2025-01-09 14:09:47,376 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:09:47" (1/1) ... [2025-01-09 14:09:47,424 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 209 [2025-01-09 14:09:47,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:09:47,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:09:47,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:09:47,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:09:47,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:09:47" (1/1) ... [2025-01-09 14:09:47,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:09:47" (1/1) ... [2025-01-09 14:09:47,438 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:09:47" (1/1) ... [2025-01-09 14:09:47,464 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:09:47,464 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:09:47" (1/1) ... [2025-01-09 14:09:47,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:09:47" (1/1) ... [2025-01-09 14:09:47,484 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:09:47" (1/1) ... [2025-01-09 14:09:47,485 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:09:47" (1/1) ... [2025-01-09 14:09:47,489 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:09:47" (1/1) ... [2025-01-09 14:09:47,495 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:09:47" (1/1) ... [2025-01-09 14:09:47,497 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:09:47" (1/1) ... [2025-01-09 14:09:47,509 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:09:47,510 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:09:47,511 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:09:47,511 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:09:47,511 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:09:47" (1/1) ... [2025-01-09 14:09:47,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:09:47,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:09:47,540 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:09:47,543 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:09:47,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:09:47,560 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:09:47,560 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:09:47,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:09:47,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:09:47,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:09:47,613 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:09:47,615 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:09:48,000 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-01-09 14:09:48,001 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:09:48,016 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:09:48,017 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:09:48,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:09:48 BoogieIcfgContainer [2025-01-09 14:09:48,018 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:09:48,019 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:09:48,019 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:09:48,023 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:09:48,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:09:47" (1/3) ... [2025-01-09 14:09:48,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f5c455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:09:48, skipping insertion in model container [2025-01-09 14:09:48,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:09:47" (2/3) ... [2025-01-09 14:09:48,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f5c455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:09:48, skipping insertion in model container [2025-01-09 14:09:48,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:09:48" (3/3) ... [2025-01-09 14:09:48,026 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-63.i [2025-01-09 14:09:48,038 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:09:48,039 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-63.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:09:48,112 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:09:48,122 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;@661d4af5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:09:48,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:09:48,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 65 states have (on average 1.476923076923077) internal successors, (96), 66 states have internal predecessors, (96), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 14:09:48,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 14:09:48,138 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:09:48,139 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:48,139 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:09:48,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:09:48,145 INFO L85 PathProgramCache]: Analyzing trace with hash 830361348, now seen corresponding path program 1 times [2025-01-09 14:09:48,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:09:48,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655740780] [2025-01-09 14:09:48,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:09:48,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:09:48,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 14:09:48,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 14:09:48,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:09:48,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:09:48,398 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 14:09:48,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:09:48,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655740780] [2025-01-09 14:09:48,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655740780] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:09:48,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807682599] [2025-01-09 14:09:48,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:09:48,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:09:48,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:09:48,403 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:09:48,404 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:09:48,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 14:09:48,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 14:09:48,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:09:48,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:09:48,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:09:48,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:09:48,566 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 14:09:48,566 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:09:48,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807682599] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:09:48,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:09:48,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:09:48,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840816222] [2025-01-09 14:09:48,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:09:48,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:09:48,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:09:48,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:09:48,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:09:48,585 INFO L87 Difference]: Start difference. First operand has 88 states, 65 states have (on average 1.476923076923077) internal successors, (96), 66 states have internal predecessors, (96), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 14:09:48,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:09:48,602 INFO L93 Difference]: Finished difference Result 168 states and 285 transitions. [2025-01-09 14:09:48,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:09:48,603 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 143 [2025-01-09 14:09:48,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:09:48,608 INFO L225 Difference]: With dead ends: 168 [2025-01-09 14:09:48,609 INFO L226 Difference]: Without dead ends: 83 [2025-01-09 14:09:48,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 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:09:48,613 INFO L435 NwaCegarLoop]: 125 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, 125 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:09:48,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:09:48,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-09 14:09:48,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-01-09 14:09:48,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 61 states have internal predecessors, (85), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 14:09:48,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2025-01-09 14:09:48,639 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 143 [2025-01-09 14:09:48,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:09:48,639 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2025-01-09 14:09:48,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 14:09:48,640 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2025-01-09 14:09:48,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 14:09:48,641 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:09:48,642 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:48,649 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:09:48,842 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:09:48,843 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:09:48,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:09:48,844 INFO L85 PathProgramCache]: Analyzing trace with hash 534562760, now seen corresponding path program 1 times [2025-01-09 14:09:48,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:09:48,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789074499] [2025-01-09 14:09:48,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:09:48,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:09:48,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 14:09:48,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 14:09:48,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:09:48,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:09:49,118 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 14:09:49,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:09:49,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789074499] [2025-01-09 14:09:49,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789074499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:09:49,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:09:49,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:09:49,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160287960] [2025-01-09 14:09:49,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:09:49,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:09:49,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:09:49,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:09:49,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:09:49,120 INFO L87 Difference]: Start difference. First operand 83 states and 125 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:09:49,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:09:49,187 INFO L93 Difference]: Finished difference Result 214 states and 321 transitions. [2025-01-09 14:09:49,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:09:49,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-01-09 14:09:49,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:09:49,189 INFO L225 Difference]: With dead ends: 214 [2025-01-09 14:09:49,190 INFO L226 Difference]: Without dead ends: 134 [2025-01-09 14:09:49,190 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:09:49,191 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 71 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:09:49,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 259 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:09:49,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-01-09 14:09:49,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2025-01-09 14:09:49,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 100 states have (on average 1.39) internal successors, (139), 101 states have internal predecessors, (139), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 14:09:49,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 195 transitions. [2025-01-09 14:09:49,205 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 195 transitions. Word has length 143 [2025-01-09 14:09:49,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:09:49,206 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 195 transitions. [2025-01-09 14:09:49,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:09:49,206 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 195 transitions. [2025-01-09 14:09:49,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 14:09:49,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:09:49,208 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:49,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:09:49,208 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:09:49,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:09:49,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1912952632, now seen corresponding path program 1 times [2025-01-09 14:09:49,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:09:49,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605985259] [2025-01-09 14:09:49,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:09:49,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:09:49,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 14:09:49,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 14:09:49,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:09:49,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:09:49,592 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 14:09:49,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:09:49,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605985259] [2025-01-09 14:09:49,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605985259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:09:49,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:09:49,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:09:49,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986590541] [2025-01-09 14:09:49,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:09:49,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:09:49,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:09:49,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:09:49,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:09:49,594 INFO L87 Difference]: Start difference. First operand 131 states and 195 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:09:49,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:09:49,742 INFO L93 Difference]: Finished difference Result 372 states and 557 transitions. [2025-01-09 14:09:49,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:09:49,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-01-09 14:09:49,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:09:49,745 INFO L225 Difference]: With dead ends: 372 [2025-01-09 14:09:49,745 INFO L226 Difference]: Without dead ends: 244 [2025-01-09 14:09:49,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:09:49,746 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 90 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:09:49,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 350 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:09:49,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-01-09 14:09:49,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 182. [2025-01-09 14:09:49,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 130 states have (on average 1.3461538461538463) internal successors, (175), 131 states have internal predecessors, (175), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 14:09:49,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 271 transitions. [2025-01-09 14:09:49,771 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 271 transitions. Word has length 143 [2025-01-09 14:09:49,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:09:49,771 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 271 transitions. [2025-01-09 14:09:49,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:09:49,772 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 271 transitions. [2025-01-09 14:09:49,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 14:09:49,773 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:09:49,773 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:49,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:09:49,773 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:09:49,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:09:49,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1694097914, now seen corresponding path program 1 times [2025-01-09 14:09:49,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:09:49,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450403079] [2025-01-09 14:09:49,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:09:49,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:09:49,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 14:09:49,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 14:09:49,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:09:49,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:09:50,223 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 14:09:50,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:09:50,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450403079] [2025-01-09 14:09:50,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450403079] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:09:50,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:09:50,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:09:50,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123077583] [2025-01-09 14:09:50,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:09:50,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:09:50,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:09:50,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:09:50,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:09:50,227 INFO L87 Difference]: Start difference. First operand 182 states and 271 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:09:50,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:09:50,369 INFO L93 Difference]: Finished difference Result 413 states and 610 transitions. [2025-01-09 14:09:50,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:09:50,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-01-09 14:09:50,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:09:50,374 INFO L225 Difference]: With dead ends: 413 [2025-01-09 14:09:50,376 INFO L226 Difference]: Without dead ends: 285 [2025-01-09 14:09:50,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:09:50,378 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 187 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:09:50,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 289 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:09:50,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-01-09 14:09:50,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 193. [2025-01-09 14:09:50,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 141 states have (on average 1.3475177304964538) internal successors, (190), 142 states have internal predecessors, (190), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 14:09:50,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 286 transitions. [2025-01-09 14:09:50,409 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 286 transitions. Word has length 143 [2025-01-09 14:09:50,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:09:50,409 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 286 transitions. [2025-01-09 14:09:50,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:09:50,410 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 286 transitions. [2025-01-09 14:09:50,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 14:09:50,412 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:09:50,412 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:50,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:09:50,413 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:09:50,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:09:50,413 INFO L85 PathProgramCache]: Analyzing trace with hash -64230972, now seen corresponding path program 1 times [2025-01-09 14:09:50,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:09:50,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895077907] [2025-01-09 14:09:50,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:09:50,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:09:50,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 14:09:50,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 14:09:50,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:09:50,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:09:55,213 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 14:09:55,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:09:55,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895077907] [2025-01-09 14:09:55,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895077907] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:09:55,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:09:55,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:09:55,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969079751] [2025-01-09 14:09:55,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:09:55,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:09:55,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:09:55,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:09:55,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:09:55,217 INFO L87 Difference]: Start difference. First operand 193 states and 286 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:09:55,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:09:55,812 INFO L93 Difference]: Finished difference Result 465 states and 685 transitions. [2025-01-09 14:09:55,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:09:55,813 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-01-09 14:09:55,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:09:55,816 INFO L225 Difference]: With dead ends: 465 [2025-01-09 14:09:55,816 INFO L226 Difference]: Without dead ends: 329 [2025-01-09 14:09:55,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:09:55,818 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 177 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:09:55,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 504 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:09:55,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-01-09 14:09:55,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 231. [2025-01-09 14:09:55,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 179 states have (on average 1.3743016759776536) internal successors, (246), 180 states have internal predecessors, (246), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 14:09:55,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 342 transitions. [2025-01-09 14:09:55,847 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 342 transitions. Word has length 143 [2025-01-09 14:09:55,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:09:55,847 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 342 transitions. [2025-01-09 14:09:55,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:09:55,847 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 342 transitions. [2025-01-09 14:09:55,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 14:09:55,850 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:09:55,851 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:55,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:09:55,851 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:09:55,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:09:55,851 INFO L85 PathProgramCache]: Analyzing trace with hash 193934466, now seen corresponding path program 1 times [2025-01-09 14:09:55,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:09:55,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470727473] [2025-01-09 14:09:55,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:09:55,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:09:55,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 14:09:55,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 14:09:55,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:09:55,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:09:59,350 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 14:09:59,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:09:59,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470727473] [2025-01-09 14:09:59,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470727473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:09:59,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:09:59,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:09:59,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840974377] [2025-01-09 14:09:59,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:09:59,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:09:59,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:09:59,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:09:59,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:09:59,354 INFO L87 Difference]: Start difference. First operand 231 states and 342 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:10:00,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:10:00,250 INFO L93 Difference]: Finished difference Result 490 states and 719 transitions. [2025-01-09 14:10:00,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:10:00,251 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-01-09 14:10:00,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:10:00,253 INFO L225 Difference]: With dead ends: 490 [2025-01-09 14:10:00,253 INFO L226 Difference]: Without dead ends: 316 [2025-01-09 14:10:00,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-01-09 14:10:00,254 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 232 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:10:00,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 681 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:10:00,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-01-09 14:10:00,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 250. [2025-01-09 14:10:00,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 198 states have (on average 1.393939393939394) internal successors, (276), 199 states have internal predecessors, (276), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 14:10:00,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2025-01-09 14:10:00,271 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 143 [2025-01-09 14:10:00,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:10:00,271 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2025-01-09 14:10:00,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:10:00,272 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2025-01-09 14:10:00,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 14:10:00,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:10:00,273 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:00,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:10:00,273 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:10:00,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:10:00,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1271396088, now seen corresponding path program 1 times [2025-01-09 14:10:00,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:10:00,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048262010] [2025-01-09 14:10:00,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:10:00,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:10:00,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 14:10:00,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 14:10:00,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:10:00,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:10:00,469 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 14:10:00,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:10:00,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048262010] [2025-01-09 14:10:00,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048262010] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:10:00,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:10:00,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:10:00,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120391533] [2025-01-09 14:10:00,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:10:00,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:10:00,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:10:00,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:10:00,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:10:00,471 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:10:00,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:10:00,586 INFO L93 Difference]: Finished difference Result 525 states and 775 transitions. [2025-01-09 14:10:00,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:10:00,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-01-09 14:10:00,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:10:00,588 INFO L225 Difference]: With dead ends: 525 [2025-01-09 14:10:00,588 INFO L226 Difference]: Without dead ends: 332 [2025-01-09 14:10:00,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:10:00,589 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 127 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:10:00,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 525 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:10:00,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-01-09 14:10:00,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 250. [2025-01-09 14:10:00,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 198 states have (on average 1.378787878787879) internal successors, (273), 199 states have internal predecessors, (273), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 14:10:00,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 369 transitions. [2025-01-09 14:10:00,600 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 369 transitions. Word has length 143 [2025-01-09 14:10:00,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:10:00,600 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 369 transitions. [2025-01-09 14:10:00,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:10:00,601 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2025-01-09 14:10:00,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 14:10:00,601 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:10:00,602 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:00,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:10:00,602 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:10:00,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:10:00,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1013230650, now seen corresponding path program 1 times [2025-01-09 14:10:00,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:10:00,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924129437] [2025-01-09 14:10:00,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:10:00,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:10:00,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 14:10:00,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 14:10:00,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:10:00,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:10:03,714 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 14:10:03,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:10:03,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924129437] [2025-01-09 14:10:03,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924129437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:10:03,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:10:03,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:10:03,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137378063] [2025-01-09 14:10:03,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:10:03,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:10:03,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:10:03,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:10:03,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:10:03,715 INFO L87 Difference]: Start difference. First operand 250 states and 369 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:10:04,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:10:04,402 INFO L93 Difference]: Finished difference Result 557 states and 814 transitions. [2025-01-09 14:10:04,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:10:04,403 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-01-09 14:10:04,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:10:04,404 INFO L225 Difference]: With dead ends: 557 [2025-01-09 14:10:04,405 INFO L226 Difference]: Without dead ends: 364 [2025-01-09 14:10:04,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:10:04,405 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 174 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:10:04,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 653 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:10:04,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-01-09 14:10:04,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 265. [2025-01-09 14:10:04,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 213 states have (on average 1.3896713615023475) internal successors, (296), 214 states have internal predecessors, (296), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 14:10:04,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 392 transitions. [2025-01-09 14:10:04,423 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 392 transitions. Word has length 143 [2025-01-09 14:10:04,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:10:04,424 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 392 transitions. [2025-01-09 14:10:04,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:10:04,424 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 392 transitions. [2025-01-09 14:10:04,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 14:10:04,426 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:10:04,426 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:04,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:10:04,427 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:10:04,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:10:04,427 INFO L85 PathProgramCache]: Analyzing trace with hash 2028374628, now seen corresponding path program 1 times [2025-01-09 14:10:04,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:10:04,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456332603] [2025-01-09 14:10:04,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:10:04,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:10:04,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 14:10:04,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 14:10:04,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:10:04,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:10:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 14:10:04,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:10:04,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456332603] [2025-01-09 14:10:04,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456332603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:10:04,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:10:04,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:10:04,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660553718] [2025-01-09 14:10:04,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:10:04,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:10:04,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:10:04,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:10:04,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:10:04,475 INFO L87 Difference]: Start difference. First operand 265 states and 392 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:10:04,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:10:04,497 INFO L93 Difference]: Finished difference Result 482 states and 714 transitions. [2025-01-09 14:10:04,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:10:04,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-01-09 14:10:04,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:10:04,500 INFO L225 Difference]: With dead ends: 482 [2025-01-09 14:10:04,500 INFO L226 Difference]: Without dead ends: 267 [2025-01-09 14:10:04,501 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:10:04,501 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:10:04,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:10:04,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-01-09 14:10:04,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2025-01-09 14:10:04,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 215 states have (on average 1.386046511627907) internal successors, (298), 216 states have internal predecessors, (298), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 14:10:04,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 394 transitions. [2025-01-09 14:10:04,519 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 394 transitions. Word has length 143 [2025-01-09 14:10:04,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:10:04,519 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 394 transitions. [2025-01-09 14:10:04,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:10:04,520 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 394 transitions. [2025-01-09 14:10:04,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 14:10:04,522 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:10:04,522 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:04,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:10:04,522 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:10:04,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:10:04,522 INFO L85 PathProgramCache]: Analyzing trace with hash -125114118, now seen corresponding path program 1 times [2025-01-09 14:10:04,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:10:04,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217885546] [2025-01-09 14:10:04,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:10:04,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:10:04,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 14:10:04,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 14:10:04,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:10:04,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:10:04,595 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 14:10:04,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:10:04,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217885546] [2025-01-09 14:10:04,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217885546] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:10:04,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:10:04,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:10:04,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540816790] [2025-01-09 14:10:04,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:10:04,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:10:04,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:10:04,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:10:04,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:10:04,597 INFO L87 Difference]: Start difference. First operand 267 states and 394 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:10:04,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:10:04,631 INFO L93 Difference]: Finished difference Result 638 states and 937 transitions. [2025-01-09 14:10:04,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:10:04,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-01-09 14:10:04,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:10:04,634 INFO L225 Difference]: With dead ends: 638 [2025-01-09 14:10:04,634 INFO L226 Difference]: Without dead ends: 429 [2025-01-09 14:10:04,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:10:04,636 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 59 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:10:04,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 338 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:10:04,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-01-09 14:10:04,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 423. [2025-01-09 14:10:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 356 states have (on average 1.3904494382022472) internal successors, (495), 359 states have internal predecessors, (495), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 14:10:04,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 615 transitions. [2025-01-09 14:10:04,659 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 615 transitions. Word has length 144 [2025-01-09 14:10:04,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:10:04,659 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 615 transitions. [2025-01-09 14:10:04,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:10:04,660 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 615 transitions. [2025-01-09 14:10:04,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 14:10:04,661 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:10:04,661 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:04,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:10:04,661 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:10:04,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:10:04,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1309730712, now seen corresponding path program 1 times [2025-01-09 14:10:04,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:10:04,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569771503] [2025-01-09 14:10:04,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:10:04,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:10:04,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 14:10:04,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 14:10:04,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:10:04,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:10:05,380 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 14:10:05,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:10:05,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569771503] [2025-01-09 14:10:05,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569771503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:10:05,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:10:05,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:10:05,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185156500] [2025-01-09 14:10:05,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:10:05,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:10:05,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:10:05,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:10:05,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:10:05,383 INFO L87 Difference]: Start difference. First operand 423 states and 615 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:10:06,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:10:06,349 INFO L93 Difference]: Finished difference Result 1556 states and 2213 transitions. [2025-01-09 14:10:06,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 14:10:06,349 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-01-09 14:10:06,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:10:06,355 INFO L225 Difference]: With dead ends: 1556 [2025-01-09 14:10:06,355 INFO L226 Difference]: Without dead ends: 1189 [2025-01-09 14:10:06,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2025-01-09 14:10:06,358 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 412 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:10:06,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 1088 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:10:06,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2025-01-09 14:10:06,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 835. [2025-01-09 14:10:06,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 756 states have (on average 1.4246031746031746) internal successors, (1077), 763 states have internal predecessors, (1077), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 14:10:06,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1213 transitions. [2025-01-09 14:10:06,397 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1213 transitions. Word has length 144 [2025-01-09 14:10:06,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:10:06,398 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1213 transitions. [2025-01-09 14:10:06,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:10:06,398 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1213 transitions. [2025-01-09 14:10:06,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 14:10:06,399 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:10:06,400 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:06,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:10:06,400 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:10:06,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:10:06,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1474267100, now seen corresponding path program 1 times [2025-01-09 14:10:06,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:10:06,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962411312] [2025-01-09 14:10:06,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:10:06,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:10:06,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 14:10:06,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 14:10:06,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:10:06,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:10:06,622 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 14:10:06,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:10:06,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962411312] [2025-01-09 14:10:06,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962411312] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:10:06,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:10:06,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:10:06,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163724450] [2025-01-09 14:10:06,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:10:06,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:10:06,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:10:06,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:10:06,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:10:06,624 INFO L87 Difference]: Start difference. First operand 835 states and 1213 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:10:06,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:10:06,809 INFO L93 Difference]: Finished difference Result 1837 states and 2654 transitions. [2025-01-09 14:10:06,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:10:06,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-01-09 14:10:06,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:10:06,816 INFO L225 Difference]: With dead ends: 1837 [2025-01-09 14:10:06,816 INFO L226 Difference]: Without dead ends: 1382 [2025-01-09 14:10:06,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:10:06,818 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 253 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:10:06,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 477 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:10:06,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2025-01-09 14:10:06,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 848. [2025-01-09 14:10:06,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 769 states have (on average 1.4161248374512354) internal successors, (1089), 776 states have internal predecessors, (1089), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 14:10:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1225 transitions. [2025-01-09 14:10:06,860 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1225 transitions. Word has length 144 [2025-01-09 14:10:06,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:10:06,861 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1225 transitions. [2025-01-09 14:10:06,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:10:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1225 transitions. [2025-01-09 14:10:06,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 14:10:06,863 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:10:06,863 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:06,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:10:06,863 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:10:06,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:10:06,863 INFO L85 PathProgramCache]: Analyzing trace with hash -932667816, now seen corresponding path program 1 times [2025-01-09 14:10:06,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:10:06,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238955725] [2025-01-09 14:10:06,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:10:06,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:10:06,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 14:10:06,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 14:10:06,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:10:06,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:10:08,230 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 14:10:08,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:10:08,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238955725] [2025-01-09 14:10:08,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238955725] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:10:08,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:10:08,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:10:08,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913814143] [2025-01-09 14:10:08,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:10:08,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:10:08,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:10:08,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:10:08,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:10:08,232 INFO L87 Difference]: Start difference. First operand 848 states and 1225 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:10:09,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:10:09,055 INFO L93 Difference]: Finished difference Result 1630 states and 2295 transitions. [2025-01-09 14:10:09,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 14:10:09,056 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-01-09 14:10:09,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:10:09,061 INFO L225 Difference]: With dead ends: 1630 [2025-01-09 14:10:09,063 INFO L226 Difference]: Without dead ends: 1116 [2025-01-09 14:10:09,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:10:09,066 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 290 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:10:09,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 933 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:10:09,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2025-01-09 14:10:09,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 802. [2025-01-09 14:10:09,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 723 states have (on average 1.4149377593360997) internal successors, (1023), 730 states have internal predecessors, (1023), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 14:10:09,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1159 transitions. [2025-01-09 14:10:09,106 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1159 transitions. Word has length 144 [2025-01-09 14:10:09,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:10:09,108 INFO L471 AbstractCegarLoop]: Abstraction has 802 states and 1159 transitions. [2025-01-09 14:10:09,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 14:10:09,108 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1159 transitions. [2025-01-09 14:10:09,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 14:10:09,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:10:09,110 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:09,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:10:09,110 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:10:09,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:10:09,110 INFO L85 PathProgramCache]: Analyzing trace with hash -253566625, now seen corresponding path program 1 times [2025-01-09 14:10:09,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:10:09,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007174921] [2025-01-09 14:10:09,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:10:09,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:10:09,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 14:10:09,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 14:10:09,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:10:09,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:10:31,001 WARN L286 SmtUtils]: Spent 7.37s on a formula simplification. DAG size of input: 170 DAG size of output: 166 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 14:11:04,395 WARN L286 SmtUtils]: Spent 18.88s on a formula simplification. DAG size of input: 184 DAG size of output: 179 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)