./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-59.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 13f0d023cf70be0ab2bade1c9c2a45b94596f842e278edf3cfbd034e77d4c50c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:45:00,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:45:00,462 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:45:00,469 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:45:00,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:45:00,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:45:00,493 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:45:00,493 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:45:00,494 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:45:00,494 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:45:00,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:45:00,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:45:00,494 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:45:00,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:45:00,494 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:45:00,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:45:00,495 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:45:00,495 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:45:00,495 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:45:00,495 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:45:00,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:45:00,495 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:45:00,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:45:00,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:45:00,495 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:45:00,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:45:00,495 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:45:00,496 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:45:00,496 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:45:00,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:45:00,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:45:00,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:45:00,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:45:00,496 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:45:00,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:45:00,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:45:00,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:45:00,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:45:00,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:45:00,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:45:00,497 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:45:00,497 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:45:00,497 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:45:00,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:45:00,497 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:45:00,497 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:45:00,497 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:45:00,497 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:45:00,497 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 -> 13f0d023cf70be0ab2bade1c9c2a45b94596f842e278edf3cfbd034e77d4c50c [2025-01-09 09:45:00,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:45:00,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:45:00,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:45:00,757 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:45:00,758 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:45:00,759 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-59.i [2025-01-09 09:45:01,935 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92272a6ed/fad4f2ff743d402584be7b6e90d679b1/FLAGf99ffb43e [2025-01-09 09:45:02,220 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:45:02,220 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-59.i [2025-01-09 09:45:02,233 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92272a6ed/fad4f2ff743d402584be7b6e90d679b1/FLAGf99ffb43e [2025-01-09 09:45:02,248 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92272a6ed/fad4f2ff743d402584be7b6e90d679b1 [2025-01-09 09:45:02,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:45:02,252 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:45:02,254 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:45:02,254 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:45:02,263 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:45:02,263 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:45:02" (1/1) ... [2025-01-09 09:45:02,264 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dc3957f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:45:02, skipping insertion in model container [2025-01-09 09:45:02,265 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:45:02" (1/1) ... [2025-01-09 09:45:02,289 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:45:02,407 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-59.i[916,929] [2025-01-09 09:45:02,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:45:02,560 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:45:02,569 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-59.i[916,929] [2025-01-09 09:45:02,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:45:02,652 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:45:02,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:45:02 WrapperNode [2025-01-09 09:45:02,653 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:45:02,655 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:45:02,655 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:45:02,655 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:45:02,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:45:02" (1/1) ... [2025-01-09 09:45:02,674 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:45:02" (1/1) ... [2025-01-09 09:45:02,736 INFO L138 Inliner]: procedures = 26, calls = 72, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 458 [2025-01-09 09:45:02,737 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:45:02,737 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:45:02,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:45:02,738 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:45:02,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:45:02" (1/1) ... [2025-01-09 09:45:02,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:45:02" (1/1) ... [2025-01-09 09:45:02,754 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:45:02" (1/1) ... [2025-01-09 09:45:02,782 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 09:45:02,782 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:45:02" (1/1) ... [2025-01-09 09:45:02,782 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:45:02" (1/1) ... [2025-01-09 09:45:02,801 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:45:02" (1/1) ... [2025-01-09 09:45:02,803 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:45:02" (1/1) ... [2025-01-09 09:45:02,807 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:45:02" (1/1) ... [2025-01-09 09:45:02,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:45:02" (1/1) ... [2025-01-09 09:45:02,815 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:45:02" (1/1) ... [2025-01-09 09:45:02,821 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:45:02,823 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:45:02,823 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:45:02,823 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:45:02,825 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:45:02" (1/1) ... [2025-01-09 09:45:02,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:45:02,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:45:02,852 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 09:45:02,855 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 09:45:02,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:45:02,873 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:45:02,874 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:45:02,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:45:02,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:45:02,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:45:02,964 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:45:02,965 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:45:03,658 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-01-09 09:45:03,659 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:45:03,671 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:45:03,672 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:45:03,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:45:03 BoogieIcfgContainer [2025-01-09 09:45:03,672 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:45:03,675 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:45:03,675 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:45:03,678 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:45:03,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:45:02" (1/3) ... [2025-01-09 09:45:03,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236ef194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:45:03, skipping insertion in model container [2025-01-09 09:45:03,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:45:02" (2/3) ... [2025-01-09 09:45:03,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236ef194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:45:03, skipping insertion in model container [2025-01-09 09:45:03,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:45:03" (3/3) ... [2025-01-09 09:45:03,681 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-59.i [2025-01-09 09:45:03,700 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:45:03,702 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-59.i that has 2 procedures, 194 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:45:03,751 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:45:03,758 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;@ce3c8aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:45:03,759 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:45:03,762 INFO L276 IsEmpty]: Start isEmpty. Operand has 194 states, 132 states have (on average 1.553030303030303) internal successors, (205), 133 states have internal predecessors, (205), 59 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 09:45:03,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-01-09 09:45:03,777 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:03,777 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:45:03,778 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:03,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:03,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1959046034, now seen corresponding path program 1 times [2025-01-09 09:45:03,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:03,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148789988] [2025-01-09 09:45:03,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:03,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:03,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-01-09 09:45:04,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-01-09 09:45:04,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:04,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:04,408 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-01-09 09:45:04,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:04,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148789988] [2025-01-09 09:45:04,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148789988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:04,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:04,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:45:04,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46430830] [2025-01-09 09:45:04,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:04,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:45:04,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:04,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:45:04,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:45:04,436 INFO L87 Difference]: Start difference. First operand has 194 states, 132 states have (on average 1.553030303030303) internal successors, (205), 133 states have internal predecessors, (205), 59 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 09:45:04,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:04,558 INFO L93 Difference]: Finished difference Result 507 states and 942 transitions. [2025-01-09 09:45:04,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:45:04,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 381 [2025-01-09 09:45:04,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:04,571 INFO L225 Difference]: With dead ends: 507 [2025-01-09 09:45:04,571 INFO L226 Difference]: Without dead ends: 316 [2025-01-09 09:45:04,575 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 09:45:04,577 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 181 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:04,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 599 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:45:04,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-01-09 09:45:04,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 313. [2025-01-09 09:45:04,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 223 states have (on average 1.5515695067264574) internal successors, (346), 224 states have internal predecessors, (346), 87 states have call successors, (87), 2 states have call predecessors, (87), 2 states have return successors, (87), 86 states have call predecessors, (87), 87 states have call successors, (87) [2025-01-09 09:45:04,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 520 transitions. [2025-01-09 09:45:04,663 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 520 transitions. Word has length 381 [2025-01-09 09:45:04,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:04,666 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 520 transitions. [2025-01-09 09:45:04,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 09:45:04,667 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 520 transitions. [2025-01-09 09:45:04,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-01-09 09:45:04,674 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:04,674 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:45:04,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 09:45:04,675 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:04,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:04,675 INFO L85 PathProgramCache]: Analyzing trace with hash -520765082, now seen corresponding path program 1 times [2025-01-09 09:45:04,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:04,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332861688] [2025-01-09 09:45:04,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:04,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:04,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-01-09 09:45:04,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-01-09 09:45:04,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:04,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:05,265 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-01-09 09:45:05,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:05,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332861688] [2025-01-09 09:45:05,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332861688] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:05,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:05,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:45:05,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902306604] [2025-01-09 09:45:05,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:05,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:45:05,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:05,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:45:05,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:45:05,271 INFO L87 Difference]: Start difference. First operand 313 states and 520 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 09:45:05,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:05,545 INFO L93 Difference]: Finished difference Result 891 states and 1484 transitions. [2025-01-09 09:45:05,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:45:05,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 381 [2025-01-09 09:45:05,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:05,553 INFO L225 Difference]: With dead ends: 891 [2025-01-09 09:45:05,554 INFO L226 Difference]: Without dead ends: 581 [2025-01-09 09:45:05,556 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 09:45:05,557 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 298 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:05,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 935 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:45:05,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-01-09 09:45:05,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 545. [2025-01-09 09:45:05,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 394 states have (on average 1.5685279187817258) internal successors, (618), 395 states have internal predecessors, (618), 146 states have call successors, (146), 4 states have call predecessors, (146), 4 states have return successors, (146), 145 states have call predecessors, (146), 146 states have call successors, (146) [2025-01-09 09:45:05,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 910 transitions. [2025-01-09 09:45:05,638 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 910 transitions. Word has length 381 [2025-01-09 09:45:05,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:05,639 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 910 transitions. [2025-01-09 09:45:05,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 09:45:05,640 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 910 transitions. [2025-01-09 09:45:05,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-01-09 09:45:05,644 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:05,645 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:45:05,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:45:05,645 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:05,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:05,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1659199464, now seen corresponding path program 1 times [2025-01-09 09:45:05,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:05,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501029166] [2025-01-09 09:45:05,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:05,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:05,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-01-09 09:45:05,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-01-09 09:45:05,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:05,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:06,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-01-09 09:45:06,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:06,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501029166] [2025-01-09 09:45:06,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501029166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:06,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:06,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:45:06,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216511259] [2025-01-09 09:45:06,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:06,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:45:06,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:06,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:45:06,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:45:06,067 INFO L87 Difference]: Start difference. First operand 545 states and 910 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 09:45:06,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:06,353 INFO L93 Difference]: Finished difference Result 1509 states and 2545 transitions. [2025-01-09 09:45:06,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:45:06,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 382 [2025-01-09 09:45:06,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:06,362 INFO L225 Difference]: With dead ends: 1509 [2025-01-09 09:45:06,363 INFO L226 Difference]: Without dead ends: 1191 [2025-01-09 09:45:06,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:45:06,365 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 325 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:06,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 1078 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:45:06,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2025-01-09 09:45:06,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1073. [2025-01-09 09:45:06,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1073 states, 891 states have (on average 1.6711560044893379) internal successors, (1489), 894 states have internal predecessors, (1489), 174 states have call successors, (174), 7 states have call predecessors, (174), 7 states have return successors, (174), 171 states have call predecessors, (174), 174 states have call successors, (174) [2025-01-09 09:45:06,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1837 transitions. [2025-01-09 09:45:06,447 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1837 transitions. Word has length 382 [2025-01-09 09:45:06,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:06,449 INFO L471 AbstractCegarLoop]: Abstraction has 1073 states and 1837 transitions. [2025-01-09 09:45:06,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 09:45:06,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1837 transitions. [2025-01-09 09:45:06,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-01-09 09:45:06,454 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:06,454 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:45:06,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:45:06,454 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:06,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:06,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1614699478, now seen corresponding path program 1 times [2025-01-09 09:45:06,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:06,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084948581] [2025-01-09 09:45:06,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:06,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:06,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-01-09 09:45:06,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-01-09 09:45:06,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:06,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:06,906 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-01-09 09:45:06,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:06,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084948581] [2025-01-09 09:45:06,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084948581] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:06,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:06,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:45:06,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875325567] [2025-01-09 09:45:06,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:06,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:45:06,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:06,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:45:06,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:45:06,909 INFO L87 Difference]: Start difference. First operand 1073 states and 1837 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-01-09 09:45:07,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:07,355 INFO L93 Difference]: Finished difference Result 2574 states and 4372 transitions. [2025-01-09 09:45:07,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:45:07,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) Word has length 382 [2025-01-09 09:45:07,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:07,369 INFO L225 Difference]: With dead ends: 2574 [2025-01-09 09:45:07,370 INFO L226 Difference]: Without dead ends: 1947 [2025-01-09 09:45:07,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:45:07,376 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 613 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:07,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 625 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:45:07,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2025-01-09 09:45:07,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 1369. [2025-01-09 09:45:07,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1187 states have (on average 1.709351305812974) internal successors, (2029), 1190 states have internal predecessors, (2029), 174 states have call successors, (174), 7 states have call predecessors, (174), 7 states have return successors, (174), 171 states have call predecessors, (174), 174 states have call successors, (174) [2025-01-09 09:45:07,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2377 transitions. [2025-01-09 09:45:07,480 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2377 transitions. Word has length 382 [2025-01-09 09:45:07,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:07,481 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 2377 transitions. [2025-01-09 09:45:07,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-01-09 09:45:07,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2377 transitions. [2025-01-09 09:45:07,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-01-09 09:45:07,489 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:07,490 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:45:07,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:45:07,490 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:07,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:07,491 INFO L85 PathProgramCache]: Analyzing trace with hash -825266740, now seen corresponding path program 1 times [2025-01-09 09:45:07,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:07,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621019472] [2025-01-09 09:45:07,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:07,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:07,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-01-09 09:45:07,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-01-09 09:45:07,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:07,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:07,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-01-09 09:45:07,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:07,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621019472] [2025-01-09 09:45:07,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621019472] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:07,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:07,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:45:07,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275643568] [2025-01-09 09:45:07,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:07,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:45:07,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:07,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:45:07,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:45:08,000 INFO L87 Difference]: Start difference. First operand 1369 states and 2377 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 09:45:08,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:08,334 INFO L93 Difference]: Finished difference Result 2929 states and 5054 transitions. [2025-01-09 09:45:08,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:45:08,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 382 [2025-01-09 09:45:08,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:08,347 INFO L225 Difference]: With dead ends: 2929 [2025-01-09 09:45:08,347 INFO L226 Difference]: Without dead ends: 2166 [2025-01-09 09:45:08,350 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 09:45:08,351 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 313 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:08,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 933 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:45:08,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2025-01-09 09:45:08,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 2130. [2025-01-09 09:45:08,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2130 states, 1829 states have (on average 1.6981957353745216) internal successors, (3106), 1835 states have internal predecessors, (3106), 289 states have call successors, (289), 11 states have call predecessors, (289), 11 states have return successors, (289), 283 states have call predecessors, (289), 289 states have call successors, (289) [2025-01-09 09:45:08,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 3684 transitions. [2025-01-09 09:45:08,482 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 3684 transitions. Word has length 382 [2025-01-09 09:45:08,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:08,483 INFO L471 AbstractCegarLoop]: Abstraction has 2130 states and 3684 transitions. [2025-01-09 09:45:08,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 09:45:08,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 3684 transitions. [2025-01-09 09:45:08,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-01-09 09:45:08,486 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:08,486 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:45:08,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:45:08,487 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:08,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:08,487 INFO L85 PathProgramCache]: Analyzing trace with hash -194688921, now seen corresponding path program 1 times [2025-01-09 09:45:08,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:08,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271966444] [2025-01-09 09:45:08,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:08,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:08,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-01-09 09:45:08,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-01-09 09:45:08,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:08,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:09,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-01-09 09:45:09,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:09,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271966444] [2025-01-09 09:45:09,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271966444] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:09,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:09,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:45:09,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379984430] [2025-01-09 09:45:09,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:09,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:45:09,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:09,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:45:09,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:45:09,353 INFO L87 Difference]: Start difference. First operand 2130 states and 3684 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 09:45:10,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:10,269 INFO L93 Difference]: Finished difference Result 8304 states and 14340 transitions. [2025-01-09 09:45:10,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 09:45:10,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 383 [2025-01-09 09:45:10,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:10,308 INFO L225 Difference]: With dead ends: 8304 [2025-01-09 09:45:10,309 INFO L226 Difference]: Without dead ends: 6718 [2025-01-09 09:45:10,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:45:10,317 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 793 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:10,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 1065 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 09:45:10,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6718 states. [2025-01-09 09:45:10,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6718 to 5598. [2025-01-09 09:45:10,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5598 states, 4882 states have (on average 1.706472757066776) internal successors, (8331), 4902 states have internal predecessors, (8331), 679 states have call successors, (679), 36 states have call predecessors, (679), 36 states have return successors, (679), 659 states have call predecessors, (679), 679 states have call successors, (679) [2025-01-09 09:45:10,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5598 states to 5598 states and 9689 transitions. [2025-01-09 09:45:10,647 INFO L78 Accepts]: Start accepts. Automaton has 5598 states and 9689 transitions. Word has length 383 [2025-01-09 09:45:10,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:10,648 INFO L471 AbstractCegarLoop]: Abstraction has 5598 states and 9689 transitions. [2025-01-09 09:45:10,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 09:45:10,648 INFO L276 IsEmpty]: Start isEmpty. Operand 5598 states and 9689 transitions. [2025-01-09 09:45:10,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-01-09 09:45:10,654 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:10,654 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:45:10,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:45:10,654 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:10,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:10,655 INFO L85 PathProgramCache]: Analyzing trace with hash -172056667, now seen corresponding path program 1 times [2025-01-09 09:45:10,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:10,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173266285] [2025-01-09 09:45:10,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:10,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:10,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-01-09 09:45:10,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-01-09 09:45:10,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:10,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:11,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-01-09 09:45:11,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:11,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173266285] [2025-01-09 09:45:11,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173266285] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:11,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:11,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:45:11,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810540606] [2025-01-09 09:45:11,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:11,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:45:11,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:11,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:45:11,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:45:11,018 INFO L87 Difference]: Start difference. First operand 5598 states and 9689 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 09:45:11,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:11,828 INFO L93 Difference]: Finished difference Result 16524 states and 28414 transitions. [2025-01-09 09:45:11,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:45:11,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 383 [2025-01-09 09:45:11,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:11,889 INFO L225 Difference]: With dead ends: 16524 [2025-01-09 09:45:11,889 INFO L226 Difference]: Without dead ends: 11647 [2025-01-09 09:45:11,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 09:45:11,905 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 510 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:11,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 674 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:45:11,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11647 states. [2025-01-09 09:45:12,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11647 to 9285. [2025-01-09 09:45:12,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9285 states, 8184 states have (on average 1.7036901270772238) internal successors, (13943), 8228 states have internal predecessors, (13943), 1039 states have call successors, (1039), 61 states have call predecessors, (1039), 61 states have return successors, (1039), 995 states have call predecessors, (1039), 1039 states have call successors, (1039) [2025-01-09 09:45:12,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9285 states to 9285 states and 16021 transitions. [2025-01-09 09:45:12,469 INFO L78 Accepts]: Start accepts. Automaton has 9285 states and 16021 transitions. Word has length 383 [2025-01-09 09:45:12,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:12,471 INFO L471 AbstractCegarLoop]: Abstraction has 9285 states and 16021 transitions. [2025-01-09 09:45:12,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 09:45:12,472 INFO L276 IsEmpty]: Start isEmpty. Operand 9285 states and 16021 transitions. [2025-01-09 09:45:12,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2025-01-09 09:45:12,478 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:12,478 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:45:12,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:45:12,478 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:12,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:12,479 INFO L85 PathProgramCache]: Analyzing trace with hash -566762336, now seen corresponding path program 1 times [2025-01-09 09:45:12,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:12,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870871339] [2025-01-09 09:45:12,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:12,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:12,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-01-09 09:45:12,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-01-09 09:45:12,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:12,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:13,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-01-09 09:45:13,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:13,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870871339] [2025-01-09 09:45:13,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870871339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:13,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:13,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:45:13,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497137991] [2025-01-09 09:45:13,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:13,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:45:13,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:13,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:45:13,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:45:13,021 INFO L87 Difference]: Start difference. First operand 9285 states and 16021 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-01-09 09:45:14,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:14,306 INFO L93 Difference]: Finished difference Result 29475 states and 50849 transitions. [2025-01-09 09:45:14,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:45:14,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) Word has length 384 [2025-01-09 09:45:14,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:14,383 INFO L225 Difference]: With dead ends: 29475 [2025-01-09 09:45:14,383 INFO L226 Difference]: Without dead ends: 21265 [2025-01-09 09:45:14,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-09 09:45:14,411 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 553 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:14,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1270 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:45:14,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21265 states. [2025-01-09 09:45:15,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21265 to 18403. [2025-01-09 09:45:15,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18403 states, 16266 states have (on average 1.6981433665314152) internal successors, (27622), 16354 states have internal predecessors, (27622), 2019 states have call successors, (2019), 117 states have call predecessors, (2019), 117 states have return successors, (2019), 1931 states have call predecessors, (2019), 2019 states have call successors, (2019) [2025-01-09 09:45:15,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18403 states to 18403 states and 31660 transitions. [2025-01-09 09:45:15,463 INFO L78 Accepts]: Start accepts. Automaton has 18403 states and 31660 transitions. Word has length 384 [2025-01-09 09:45:15,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:15,464 INFO L471 AbstractCegarLoop]: Abstraction has 18403 states and 31660 transitions. [2025-01-09 09:45:15,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-01-09 09:45:15,466 INFO L276 IsEmpty]: Start isEmpty. Operand 18403 states and 31660 transitions. [2025-01-09 09:45:15,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2025-01-09 09:45:15,476 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:15,477 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:45:15,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:45:15,478 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:15,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:15,480 INFO L85 PathProgramCache]: Analyzing trace with hash 2042185090, now seen corresponding path program 1 times [2025-01-09 09:45:15,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:15,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532583994] [2025-01-09 09:45:15,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:15,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:15,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-01-09 09:45:15,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-01-09 09:45:15,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:15,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:15,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-01-09 09:45:15,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:15,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532583994] [2025-01-09 09:45:15,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532583994] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:15,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:15,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:45:15,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055079258] [2025-01-09 09:45:15,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:15,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:45:15,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:15,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:45:15,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:45:15,876 INFO L87 Difference]: Start difference. First operand 18403 states and 31660 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-01-09 09:45:17,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:17,526 INFO L93 Difference]: Finished difference Result 38720 states and 65550 transitions. [2025-01-09 09:45:17,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 09:45:17,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) Word has length 384 [2025-01-09 09:45:17,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:17,616 INFO L225 Difference]: With dead ends: 38720 [2025-01-09 09:45:17,616 INFO L226 Difference]: Without dead ends: 23640 [2025-01-09 09:45:17,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 09:45:17,665 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 807 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:17,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 865 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:45:17,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23640 states. [2025-01-09 09:45:18,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23640 to 18790. [2025-01-09 09:45:18,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18790 states, 16149 states have (on average 1.6601027927425847) internal successors, (26809), 16261 states have internal predecessors, (26809), 2451 states have call successors, (2451), 189 states have call predecessors, (2451), 189 states have return successors, (2451), 2339 states have call predecessors, (2451), 2451 states have call successors, (2451) [2025-01-09 09:45:18,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18790 states to 18790 states and 31711 transitions. [2025-01-09 09:45:18,875 INFO L78 Accepts]: Start accepts. Automaton has 18790 states and 31711 transitions. Word has length 384 [2025-01-09 09:45:18,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:18,877 INFO L471 AbstractCegarLoop]: Abstraction has 18790 states and 31711 transitions. [2025-01-09 09:45:18,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-01-09 09:45:18,877 INFO L276 IsEmpty]: Start isEmpty. Operand 18790 states and 31711 transitions. [2025-01-09 09:45:18,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-01-09 09:45:18,887 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:18,887 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:45:18,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 09:45:18,888 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:18,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:18,891 INFO L85 PathProgramCache]: Analyzing trace with hash -731927273, now seen corresponding path program 1 times [2025-01-09 09:45:18,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:18,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015870205] [2025-01-09 09:45:18,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:18,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:18,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-01-09 09:45:18,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-01-09 09:45:18,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:18,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:19,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-01-09 09:45:19,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:19,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015870205] [2025-01-09 09:45:19,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015870205] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:19,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:19,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 09:45:19,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188017686] [2025-01-09 09:45:19,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:19,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 09:45:19,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:19,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 09:45:19,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:45:19,947 INFO L87 Difference]: Start difference. First operand 18790 states and 31711 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-01-09 09:45:21,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:21,677 INFO L93 Difference]: Finished difference Result 32880 states and 54962 transitions. [2025-01-09 09:45:21,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 09:45:21,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) Word has length 385 [2025-01-09 09:45:21,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:21,762 INFO L225 Difference]: With dead ends: 32880 [2025-01-09 09:45:21,763 INFO L226 Difference]: Without dead ends: 27270 [2025-01-09 09:45:21,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:45:21,783 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 571 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:21,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 1295 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 09:45:21,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27270 states. [2025-01-09 09:45:23,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27270 to 23114. [2025-01-09 09:45:23,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23114 states, 19705 states have (on average 1.6474498858157829) internal successors, (32463), 19857 states have internal predecessors, (32463), 3155 states have call successors, (3155), 253 states have call predecessors, (3155), 253 states have return successors, (3155), 3003 states have call predecessors, (3155), 3155 states have call successors, (3155) [2025-01-09 09:45:23,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23114 states to 23114 states and 38773 transitions. [2025-01-09 09:45:23,359 INFO L78 Accepts]: Start accepts. Automaton has 23114 states and 38773 transitions. Word has length 385 [2025-01-09 09:45:23,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:23,360 INFO L471 AbstractCegarLoop]: Abstraction has 23114 states and 38773 transitions. [2025-01-09 09:45:23,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-01-09 09:45:23,361 INFO L276 IsEmpty]: Start isEmpty. Operand 23114 states and 38773 transitions. [2025-01-09 09:45:23,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-01-09 09:45:23,375 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:23,375 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:45:23,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 09:45:23,375 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:23,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:23,376 INFO L85 PathProgramCache]: Analyzing trace with hash -709295019, now seen corresponding path program 1 times [2025-01-09 09:45:23,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:23,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373894978] [2025-01-09 09:45:23,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:23,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:23,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-01-09 09:45:23,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-01-09 09:45:23,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:23,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:24,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-01-09 09:45:24,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:24,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373894978] [2025-01-09 09:45:24,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373894978] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:24,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:24,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 09:45:24,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37562176] [2025-01-09 09:45:24,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:24,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 09:45:24,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:24,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 09:45:24,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:45:24,958 INFO L87 Difference]: Start difference. First operand 23114 states and 38773 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-01-09 09:45:30,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:30,407 INFO L93 Difference]: Finished difference Result 77687 states and 129451 transitions. [2025-01-09 09:45:30,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 09:45:30,408 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) Word has length 385 [2025-01-09 09:45:30,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:30,627 INFO L225 Difference]: With dead ends: 77687 [2025-01-09 09:45:30,628 INFO L226 Difference]: Without dead ends: 59019 [2025-01-09 09:45:30,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:45:30,694 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 2435 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2435 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:30,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2435 Valid, 1436 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 09:45:30,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59019 states. [2025-01-09 09:45:32,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59019 to 24560. [2025-01-09 09:45:32,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24560 states, 21151 states have (on average 1.6545317006288118) internal successors, (34995), 21303 states have internal predecessors, (34995), 3155 states have call successors, (3155), 253 states have call predecessors, (3155), 253 states have return successors, (3155), 3003 states have call predecessors, (3155), 3155 states have call successors, (3155) [2025-01-09 09:45:32,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24560 states to 24560 states and 41305 transitions. [2025-01-09 09:45:32,575 INFO L78 Accepts]: Start accepts. Automaton has 24560 states and 41305 transitions. Word has length 385 [2025-01-09 09:45:32,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:32,576 INFO L471 AbstractCegarLoop]: Abstraction has 24560 states and 41305 transitions. [2025-01-09 09:45:32,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-01-09 09:45:32,576 INFO L276 IsEmpty]: Start isEmpty. Operand 24560 states and 41305 transitions. [2025-01-09 09:45:32,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-01-09 09:45:32,588 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:32,589 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:45:32,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 09:45:32,589 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:32,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:32,590 INFO L85 PathProgramCache]: Analyzing trace with hash -152590127, now seen corresponding path program 1 times [2025-01-09 09:45:32,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:32,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810946731] [2025-01-09 09:45:32,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:32,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:32,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-01-09 09:45:32,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-01-09 09:45:32,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:32,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:33,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-01-09 09:45:33,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:33,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810946731] [2025-01-09 09:45:33,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810946731] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:45:33,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:45:33,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:45:33,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94171864] [2025-01-09 09:45:33,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:45:33,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:45:33,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:33,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:45:33,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:45:33,397 INFO L87 Difference]: Start difference. First operand 24560 states and 41305 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-01-09 09:45:37,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:37,126 INFO L93 Difference]: Finished difference Result 71577 states and 119698 transitions. [2025-01-09 09:45:37,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:45:37,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) Word has length 385 [2025-01-09 09:45:37,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:37,290 INFO L225 Difference]: With dead ends: 71577 [2025-01-09 09:45:37,290 INFO L226 Difference]: Without dead ends: 50057 [2025-01-09 09:45:37,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:45:37,352 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 626 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:37,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 730 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:45:37,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50057 states. [2025-01-09 09:45:39,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50057 to 38635. [2025-01-09 09:45:39,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38635 states, 33113 states have (on average 1.6519795850572283) internal successors, (54702), 33393 states have internal predecessors, (54702), 5139 states have call successors, (5139), 382 states have call predecessors, (5139), 382 states have return successors, (5139), 4859 states have call predecessors, (5139), 5139 states have call successors, (5139) [2025-01-09 09:45:39,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38635 states to 38635 states and 64980 transitions. [2025-01-09 09:45:40,009 INFO L78 Accepts]: Start accepts. Automaton has 38635 states and 64980 transitions. Word has length 385 [2025-01-09 09:45:40,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:45:40,010 INFO L471 AbstractCegarLoop]: Abstraction has 38635 states and 64980 transitions. [2025-01-09 09:45:40,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-01-09 09:45:40,010 INFO L276 IsEmpty]: Start isEmpty. Operand 38635 states and 64980 transitions. [2025-01-09 09:45:40,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-01-09 09:45:40,022 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:45:40,023 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:45:40,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 09:45:40,023 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:45:40,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:45:40,024 INFO L85 PathProgramCache]: Analyzing trace with hash 95556367, now seen corresponding path program 1 times [2025-01-09 09:45:40,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:45:40,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615977422] [2025-01-09 09:45:40,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:40,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:45:40,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-01-09 09:45:40,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-01-09 09:45:40,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:40,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:40,536 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 111 proven. 63 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-01-09 09:45:40,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:45:40,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615977422] [2025-01-09 09:45:40,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615977422] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:45:40,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668434250] [2025-01-09 09:45:40,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:45:40,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:45:40,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:45:40,540 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 09:45:40,547 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 09:45:40,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-01-09 09:45:40,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-01-09 09:45:40,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:45:40,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:45:40,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 09:45:40,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:45:42,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 3499 proven. 21 refuted. 0 times theorem prover too weak. 3324 trivial. 0 not checked. [2025-01-09 09:45:42,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:45:42,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 153 proven. 21 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-01-09 09:45:42,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668434250] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:45:42,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:45:42,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 16 [2025-01-09 09:45:42,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885975446] [2025-01-09 09:45:42,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:45:42,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 09:45:42,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:45:42,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 09:45:42,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-01-09 09:45:42,615 INFO L87 Difference]: Start difference. First operand 38635 states and 64980 transitions. Second operand has 16 states, 16 states have (on average 15.5625) internal successors, (249), 16 states have internal predecessors, (249), 8 states have call successors, (177), 4 states have call predecessors, (177), 7 states have return successors, (177), 8 states have call predecessors, (177), 8 states have call successors, (177) [2025-01-09 09:45:54,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:45:54,621 INFO L93 Difference]: Finished difference Result 153801 states and 255094 transitions. [2025-01-09 09:45:54,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-09 09:45:54,621 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 15.5625) internal successors, (249), 16 states have internal predecessors, (249), 8 states have call successors, (177), 4 states have call predecessors, (177), 7 states have return successors, (177), 8 states have call predecessors, (177), 8 states have call successors, (177) Word has length 385 [2025-01-09 09:45:54,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:45:54,997 INFO L225 Difference]: With dead ends: 153801 [2025-01-09 09:45:54,997 INFO L226 Difference]: Without dead ends: 118541 [2025-01-09 09:45:55,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 800 GetRequests, 765 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=361, Invalid=971, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 09:45:55,082 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 1741 mSDsluCounter, 2444 mSDsCounter, 0 mSdLazyCounter, 1866 mSolverCounterSat, 1115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1817 SdHoareTripleChecker+Valid, 2750 SdHoareTripleChecker+Invalid, 2981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1115 IncrementalHoareTripleChecker+Valid, 1866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 09:45:55,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1817 Valid, 2750 Invalid, 2981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1115 Valid, 1866 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 09:45:55,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118541 states. [2025-01-09 09:46:03,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118541 to 88811. [2025-01-09 09:46:03,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88811 states, 74974 states have (on average 1.6090511377277457) internal successors, (120637), 75678 states have internal predecessors, (120637), 12827 states have call successors, (12827), 1009 states have call predecessors, (12827), 1009 states have return successors, (12827), 12123 states have call predecessors, (12827), 12827 states have call successors, (12827) [2025-01-09 09:46:03,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88811 states to 88811 states and 146291 transitions. [2025-01-09 09:46:03,816 INFO L78 Accepts]: Start accepts. Automaton has 88811 states and 146291 transitions. Word has length 385 [2025-01-09 09:46:03,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:46:03,816 INFO L471 AbstractCegarLoop]: Abstraction has 88811 states and 146291 transitions. [2025-01-09 09:46:03,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 15.5625) internal successors, (249), 16 states have internal predecessors, (249), 8 states have call successors, (177), 4 states have call predecessors, (177), 7 states have return successors, (177), 8 states have call predecessors, (177), 8 states have call successors, (177) [2025-01-09 09:46:03,817 INFO L276 IsEmpty]: Start isEmpty. Operand 88811 states and 146291 transitions. [2025-01-09 09:46:03,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-01-09 09:46:03,843 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:46:03,843 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:46:03,851 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 09:46:04,047 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,SelfDestructingSolverStorable12 [2025-01-09 09:46:04,047 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:46:04,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:46:04,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1483408325, now seen corresponding path program 1 times [2025-01-09 09:46:04,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:46:04,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632751500] [2025-01-09 09:46:04,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:46:04,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:46:04,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-01-09 09:46:04,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-01-09 09:46:04,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:46:04,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:46:04,859 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 78 proven. 96 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-01-09 09:46:04,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:46:04,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632751500] [2025-01-09 09:46:04,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632751500] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:46:04,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266060400] [2025-01-09 09:46:04,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:46:04,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:46:04,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:46:04,862 INFO L229 MonitoredProcess]: Starting monitored process 3 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 09:46:04,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 09:46:04,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-01-09 09:46:05,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-01-09 09:46:05,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:46:05,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:46:05,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 09:46:05,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:46:05,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 3472 proven. 186 refuted. 0 times theorem prover too weak. 3186 trivial. 0 not checked. [2025-01-09 09:46:05,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:46:06,167 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 156 proven. 189 refuted. 0 times theorem prover too weak. 6499 trivial. 0 not checked. [2025-01-09 09:46:06,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266060400] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:46:06,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:46:06,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 10] total 20 [2025-01-09 09:46:06,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911448354] [2025-01-09 09:46:06,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:46:06,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 09:46:06,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:46:06,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 09:46:06,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2025-01-09 09:46:06,170 INFO L87 Difference]: Start difference. First operand 88811 states and 146291 transitions. Second operand has 20 states, 18 states have (on average 11.444444444444445) internal successors, (206), 18 states have internal predecessors, (206), 7 states have call successors, (124), 3 states have call predecessors, (124), 6 states have return successors, (125), 6 states have call predecessors, (125), 7 states have call successors, (125) [2025-01-09 09:46:12,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:46:12,097 INFO L93 Difference]: Finished difference Result 140469 states and 230479 transitions. [2025-01-09 09:46:12,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 09:46:12,098 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 11.444444444444445) internal successors, (206), 18 states have internal predecessors, (206), 7 states have call successors, (124), 3 states have call predecessors, (124), 6 states have return successors, (125), 6 states have call predecessors, (125), 7 states have call successors, (125) Word has length 387 [2025-01-09 09:46:12,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:46:12,315 INFO L225 Difference]: With dead ends: 140469 [2025-01-09 09:46:12,315 INFO L226 Difference]: Without dead ends: 59983 [2025-01-09 09:46:12,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 808 GetRequests, 766 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=588, Invalid=1304, Unknown=0, NotChecked=0, Total=1892 [2025-01-09 09:46:12,470 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 544 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 1982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:46:12,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 1371 Invalid, 1982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 09:46:12,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59983 states.