./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-99.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-99.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 3fc2dee412d1614ffe2e48e99f34626a98e2bc7bb385efe0786b8cd06ee2804e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:10:04,677 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:10:04,740 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:10:04,743 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:10:04,743 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:10:04,756 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:10:04,756 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:10:04,756 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:10:04,756 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:10:04,756 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:10:04,757 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:10:04,757 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:10:04,757 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:10:04,757 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:10:04,757 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:10:04,757 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:10:04,757 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:10:04,757 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:10:04,758 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:10:04,758 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:10:04,758 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:10:04,758 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:10:04,758 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:10:04,758 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:10:04,758 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:10:04,758 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:10:04,758 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:10:04,758 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:10:04,758 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:10:04,758 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:10:04,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:10:04,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:10:04,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:10:04,759 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:10:04,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:10:04,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:10:04,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:10:04,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:10:04,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:10:04,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:10:04,759 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:10:04,760 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:10:04,760 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:10:04,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:10:04,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:10:04,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:10:04,760 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:10:04,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:10:04,760 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 -> 3fc2dee412d1614ffe2e48e99f34626a98e2bc7bb385efe0786b8cd06ee2804e [2025-01-09 10:10:04,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:10:04,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:10:04,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:10:04,949 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:10:04,949 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:10:04,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-99.i [2025-01-09 10:10:06,118 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6bf6fd3eb/44b93da06e41473b8fa4e8d5083e80d9/FLAGfe04e7f9c [2025-01-09 10:10:06,466 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:10:06,471 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-99.i [2025-01-09 10:10:06,483 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6bf6fd3eb/44b93da06e41473b8fa4e8d5083e80d9/FLAGfe04e7f9c [2025-01-09 10:10:06,688 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6bf6fd3eb/44b93da06e41473b8fa4e8d5083e80d9 [2025-01-09 10:10:06,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:10:06,691 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:10:06,692 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:10:06,692 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:10:06,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:10:06,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:10:06" (1/1) ... [2025-01-09 10:10:06,695 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5069a45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:06, skipping insertion in model container [2025-01-09 10:10:06,695 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:10:06" (1/1) ... [2025-01-09 10:10:06,720 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:10:06,851 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-99.i[916,929] [2025-01-09 10:10:06,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:10:06,987 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:10:06,993 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-99.i[916,929] [2025-01-09 10:10:07,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:10:07,074 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:10:07,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:07 WrapperNode [2025-01-09 10:10:07,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:10:07,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:10:07,075 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:10:07,076 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:10:07,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:07" (1/1) ... [2025-01-09 10:10:07,090 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:07" (1/1) ... [2025-01-09 10:10:07,151 INFO L138 Inliner]: procedures = 26, calls = 119, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 916 [2025-01-09 10:10:07,151 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:10:07,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:10:07,152 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:10:07,152 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:10:07,158 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:07" (1/1) ... [2025-01-09 10:10:07,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:07" (1/1) ... [2025-01-09 10:10:07,169 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:07" (1/1) ... [2025-01-09 10:10:07,198 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 10:10:07,200 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:07" (1/1) ... [2025-01-09 10:10:07,200 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:07" (1/1) ... [2025-01-09 10:10:07,222 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:07" (1/1) ... [2025-01-09 10:10:07,227 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:07" (1/1) ... [2025-01-09 10:10:07,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:07" (1/1) ... [2025-01-09 10:10:07,242 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:07" (1/1) ... [2025-01-09 10:10:07,248 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:07" (1/1) ... [2025-01-09 10:10:07,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:10:07,261 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:10:07,261 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:10:07,261 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:10:07,266 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:07" (1/1) ... [2025-01-09 10:10:07,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:10:07,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:10:07,302 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 10:10:07,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 10:10:07,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:10:07,321 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:10:07,321 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:10:07,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:10:07,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:10:07,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:10:07,414 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:10:07,415 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:10:08,441 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-01-09 10:10:08,442 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:10:08,459 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:10:08,462 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:10:08,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:10:08 BoogieIcfgContainer [2025-01-09 10:10:08,463 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:10:08,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:10:08,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:10:08,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:10:08,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:10:06" (1/3) ... [2025-01-09 10:10:08,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@543a4b6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:10:08, skipping insertion in model container [2025-01-09 10:10:08,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:10:07" (2/3) ... [2025-01-09 10:10:08,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@543a4b6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:10:08, skipping insertion in model container [2025-01-09 10:10:08,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:10:08" (3/3) ... [2025-01-09 10:10:08,471 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-99.i [2025-01-09 10:10:08,485 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:10:08,487 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-99.i that has 2 procedures, 372 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:10:08,550 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:10:08,561 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;@1f9b21d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:10:08,561 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:10:08,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 372 states, 263 states have (on average 1.596958174904943) internal successors, (420), 264 states have internal predecessors, (420), 106 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 106 states have call predecessors, (106), 106 states have call successors, (106) [2025-01-09 10:10:08,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2025-01-09 10:10:08,600 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:08,601 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:10:08,601 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:08,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:08,608 INFO L85 PathProgramCache]: Analyzing trace with hash -982253562, now seen corresponding path program 1 times [2025-01-09 10:10:08,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:08,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165310050] [2025-01-09 10:10:08,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:08,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:08,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 687 statements into 1 equivalence classes. [2025-01-09 10:10:08,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 687 of 687 statements. [2025-01-09 10:10:08,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:08,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:09,187 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 22050 trivial. 0 not checked. [2025-01-09 10:10:09,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:09,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165310050] [2025-01-09 10:10:09,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165310050] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:10:09,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926311635] [2025-01-09 10:10:09,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:09,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:10:09,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:10:09,195 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:10:09,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 10:10:09,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 687 statements into 1 equivalence classes. [2025-01-09 10:10:09,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 687 of 687 statements. [2025-01-09 10:10:09,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:09,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:09,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 1573 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:10:09,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:10:09,706 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 22050 trivial. 0 not checked. [2025-01-09 10:10:09,706 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:10:09,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926311635] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:09,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:10:09,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:10:09,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296169336] [2025-01-09 10:10:09,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:09,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:10:09,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:09,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:10:09,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:10:09,739 INFO L87 Difference]: Start difference. First operand has 372 states, 263 states have (on average 1.596958174904943) internal successors, (420), 264 states have internal predecessors, (420), 106 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 106 states have call predecessors, (106), 106 states have call successors, (106) Second operand has 2 states, 2 states have (on average 81.0) internal successors, (162), 2 states have internal predecessors, (162), 2 states have call successors, (106), 2 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 2 states have call successors, (106) [2025-01-09 10:10:09,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:09,785 INFO L93 Difference]: Finished difference Result 738 states and 1365 transitions. [2025-01-09 10:10:09,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:10:09,787 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 81.0) internal successors, (162), 2 states have internal predecessors, (162), 2 states have call successors, (106), 2 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 2 states have call successors, (106) Word has length 687 [2025-01-09 10:10:09,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:09,795 INFO L225 Difference]: With dead ends: 738 [2025-01-09 10:10:09,795 INFO L226 Difference]: Without dead ends: 369 [2025-01-09 10:10:09,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 688 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:10:09,802 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:09,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:10:09,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-01-09 10:10:09,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2025-01-09 10:10:09,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 261 states have (on average 1.5862068965517242) internal successors, (414), 261 states have internal predecessors, (414), 106 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 106 states have call predecessors, (106), 106 states have call successors, (106) [2025-01-09 10:10:09,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 626 transitions. [2025-01-09 10:10:09,880 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 626 transitions. Word has length 687 [2025-01-09 10:10:09,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:09,880 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 626 transitions. [2025-01-09 10:10:09,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 81.0) internal successors, (162), 2 states have internal predecessors, (162), 2 states have call successors, (106), 2 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 2 states have call successors, (106) [2025-01-09 10:10:09,881 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 626 transitions. [2025-01-09 10:10:09,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2025-01-09 10:10:09,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:09,899 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:10:09,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 10:10:10,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 10:10:10,104 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:10,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:10,105 INFO L85 PathProgramCache]: Analyzing trace with hash 452452354, now seen corresponding path program 1 times [2025-01-09 10:10:10,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:10,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075281671] [2025-01-09 10:10:10,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:10,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:10,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 687 statements into 1 equivalence classes. [2025-01-09 10:10:10,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 687 of 687 statements. [2025-01-09 10:10:10,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:10,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:10,830 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-01-09 10:10:10,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:10,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075281671] [2025-01-09 10:10:10,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075281671] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:10,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:10,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:10:10,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650086391] [2025-01-09 10:10:10,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:10,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:10:10,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:10,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:10:10,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:10:10,833 INFO L87 Difference]: Start difference. First operand 369 states and 626 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-01-09 10:10:10,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:10,936 INFO L93 Difference]: Finished difference Result 990 states and 1688 transitions. [2025-01-09 10:10:10,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:10:10,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 687 [2025-01-09 10:10:10,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:10,945 INFO L225 Difference]: With dead ends: 990 [2025-01-09 10:10:10,946 INFO L226 Difference]: Without dead ends: 624 [2025-01-09 10:10:10,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:10:10,948 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 425 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:10,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1341 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:10:10,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-01-09 10:10:11,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 621. [2025-01-09 10:10:11,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 469 states have (on average 1.6226012793176972) internal successors, (761), 470 states have internal predecessors, (761), 149 states have call successors, (149), 2 states have call predecessors, (149), 2 states have return successors, (149), 148 states have call predecessors, (149), 149 states have call successors, (149) [2025-01-09 10:10:11,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1059 transitions. [2025-01-09 10:10:11,029 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 1059 transitions. Word has length 687 [2025-01-09 10:10:11,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:11,031 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 1059 transitions. [2025-01-09 10:10:11,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-01-09 10:10:11,032 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 1059 transitions. [2025-01-09 10:10:11,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2025-01-09 10:10:11,045 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:11,046 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:10:11,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:10:11,046 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:11,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:11,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1989995708, now seen corresponding path program 1 times [2025-01-09 10:10:11,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:11,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239812099] [2025-01-09 10:10:11,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:11,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:11,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 687 statements into 1 equivalence classes. [2025-01-09 10:10:11,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 687 of 687 statements. [2025-01-09 10:10:11,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:11,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:11,631 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-01-09 10:10:11,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:11,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239812099] [2025-01-09 10:10:11,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239812099] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:11,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:11,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:10:11,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179033585] [2025-01-09 10:10:11,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:11,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:10:11,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:11,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:10:11,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:10:11,638 INFO L87 Difference]: Start difference. First operand 621 states and 1059 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-01-09 10:10:12,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:12,441 INFO L93 Difference]: Finished difference Result 2709 states and 4614 transitions. [2025-01-09 10:10:12,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 10:10:12,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 687 [2025-01-09 10:10:12,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:12,460 INFO L225 Difference]: With dead ends: 2709 [2025-01-09 10:10:12,460 INFO L226 Difference]: Without dead ends: 2091 [2025-01-09 10:10:12,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:10:12,467 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 1531 mSDsluCounter, 2602 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1531 SdHoareTripleChecker+Valid, 3340 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:12,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1531 Valid, 3340 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 10:10:12,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2025-01-09 10:10:12,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1800. [2025-01-09 10:10:12,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1800 states, 1472 states have (on average 1.672554347826087) internal successors, (2462), 1477 states have internal predecessors, (2462), 319 states have call successors, (319), 8 states have call predecessors, (319), 8 states have return successors, (319), 314 states have call predecessors, (319), 319 states have call successors, (319) [2025-01-09 10:10:12,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 3100 transitions. [2025-01-09 10:10:12,605 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 3100 transitions. Word has length 687 [2025-01-09 10:10:12,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:12,607 INFO L471 AbstractCegarLoop]: Abstraction has 1800 states and 3100 transitions. [2025-01-09 10:10:12,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-01-09 10:10:12,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 3100 transitions. [2025-01-09 10:10:12,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2025-01-09 10:10:12,614 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:12,615 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:10:12,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:10:12,615 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:12,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:12,616 INFO L85 PathProgramCache]: Analyzing trace with hash 738213638, now seen corresponding path program 1 times [2025-01-09 10:10:12,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:12,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681837031] [2025-01-09 10:10:12,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:12,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:12,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 687 statements into 1 equivalence classes. [2025-01-09 10:10:12,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 687 of 687 statements. [2025-01-09 10:10:12,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:12,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:13,001 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-01-09 10:10:13,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:13,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681837031] [2025-01-09 10:10:13,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681837031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:13,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:13,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:10:13,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003422713] [2025-01-09 10:10:13,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:13,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:10:13,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:13,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:10:13,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:10:13,004 INFO L87 Difference]: Start difference. First operand 1800 states and 3100 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-01-09 10:10:13,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:13,099 INFO L93 Difference]: Finished difference Result 4695 states and 8063 transitions. [2025-01-09 10:10:13,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:10:13,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 687 [2025-01-09 10:10:13,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:13,114 INFO L225 Difference]: With dead ends: 4695 [2025-01-09 10:10:13,115 INFO L226 Difference]: Without dead ends: 2898 [2025-01-09 10:10:13,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:10:13,120 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 427 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:13,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1233 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:10:13,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2025-01-09 10:10:13,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2896. [2025-01-09 10:10:13,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2896 states, 2316 states have (on average 1.6550086355785838) internal successors, (3833), 2324 states have internal predecessors, (3833), 564 states have call successors, (564), 15 states have call predecessors, (564), 15 states have return successors, (564), 556 states have call predecessors, (564), 564 states have call successors, (564) [2025-01-09 10:10:13,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2896 states to 2896 states and 4961 transitions. [2025-01-09 10:10:13,252 INFO L78 Accepts]: Start accepts. Automaton has 2896 states and 4961 transitions. Word has length 687 [2025-01-09 10:10:13,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:13,253 INFO L471 AbstractCegarLoop]: Abstraction has 2896 states and 4961 transitions. [2025-01-09 10:10:13,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-01-09 10:10:13,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2896 states and 4961 transitions. [2025-01-09 10:10:13,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2025-01-09 10:10:13,260 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:13,260 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:10:13,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:10:13,261 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:13,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:13,261 INFO L85 PathProgramCache]: Analyzing trace with hash 245587464, now seen corresponding path program 1 times [2025-01-09 10:10:13,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:13,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359739888] [2025-01-09 10:10:13,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:13,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:13,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 687 statements into 1 equivalence classes. [2025-01-09 10:10:13,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 687 of 687 statements. [2025-01-09 10:10:13,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:13,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:13,676 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-01-09 10:10:13,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:13,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359739888] [2025-01-09 10:10:13,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359739888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:13,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:13,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:10:13,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616892990] [2025-01-09 10:10:13,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:13,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:10:13,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:13,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:10:13,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:10:13,678 INFO L87 Difference]: Start difference. First operand 2896 states and 4961 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-01-09 10:10:14,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:14,466 INFO L93 Difference]: Finished difference Result 10892 states and 18696 transitions. [2025-01-09 10:10:14,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:10:14,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 687 [2025-01-09 10:10:14,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:14,504 INFO L225 Difference]: With dead ends: 10892 [2025-01-09 10:10:14,504 INFO L226 Difference]: Without dead ends: 8070 [2025-01-09 10:10:14,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:10:14,513 INFO L435 NwaCegarLoop]: 1066 mSDtfsCounter, 1228 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 2622 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:14,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1228 Valid, 2622 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 10:10:14,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8070 states. [2025-01-09 10:10:14,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8070 to 5706. [2025-01-09 10:10:14,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5706 states, 4731 states have (on average 1.6721623335447051) internal successors, (7911), 4749 states have internal predecessors, (7911), 944 states have call successors, (944), 30 states have call predecessors, (944), 30 states have return successors, (944), 926 states have call predecessors, (944), 944 states have call successors, (944) [2025-01-09 10:10:14,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5706 states to 5706 states and 9799 transitions. [2025-01-09 10:10:14,782 INFO L78 Accepts]: Start accepts. Automaton has 5706 states and 9799 transitions. Word has length 687 [2025-01-09 10:10:14,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:14,783 INFO L471 AbstractCegarLoop]: Abstraction has 5706 states and 9799 transitions. [2025-01-09 10:10:14,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-01-09 10:10:14,783 INFO L276 IsEmpty]: Start isEmpty. Operand 5706 states and 9799 transitions. [2025-01-09 10:10:14,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-01-09 10:10:14,793 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:14,793 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:10:14,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:10:14,793 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:14,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:14,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1233794312, now seen corresponding path program 1 times [2025-01-09 10:10:14,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:14,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416665708] [2025-01-09 10:10:14,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:14,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:14,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-01-09 10:10:14,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-01-09 10:10:14,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:14,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:15,042 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-01-09 10:10:15,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:15,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416665708] [2025-01-09 10:10:15,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416665708] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:15,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:15,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:10:15,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762717011] [2025-01-09 10:10:15,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:15,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:10:15,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:15,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:10:15,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:10:15,044 INFO L87 Difference]: Start difference. First operand 5706 states and 9799 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-01-09 10:10:15,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:15,203 INFO L93 Difference]: Finished difference Result 11370 states and 19506 transitions. [2025-01-09 10:10:15,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:10:15,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 688 [2025-01-09 10:10:15,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:15,234 INFO L225 Difference]: With dead ends: 11370 [2025-01-09 10:10:15,234 INFO L226 Difference]: Without dead ends: 5738 [2025-01-09 10:10:15,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:10:15,249 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 389 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:15,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 793 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:10:15,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5738 states. [2025-01-09 10:10:15,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5738 to 3330. [2025-01-09 10:10:15,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3330 states, 2674 states have (on average 1.6462228870605835) internal successors, (4402), 2683 states have internal predecessors, (4402), 629 states have call successors, (629), 26 states have call predecessors, (629), 26 states have return successors, (629), 620 states have call predecessors, (629), 629 states have call successors, (629) [2025-01-09 10:10:15,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3330 states to 3330 states and 5660 transitions. [2025-01-09 10:10:15,457 INFO L78 Accepts]: Start accepts. Automaton has 3330 states and 5660 transitions. Word has length 688 [2025-01-09 10:10:15,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:15,459 INFO L471 AbstractCegarLoop]: Abstraction has 3330 states and 5660 transitions. [2025-01-09 10:10:15,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-01-09 10:10:15,459 INFO L276 IsEmpty]: Start isEmpty. Operand 3330 states and 5660 transitions. [2025-01-09 10:10:15,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-01-09 10:10:15,466 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:15,466 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:10:15,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:10:15,466 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:15,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:15,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1195079672, now seen corresponding path program 1 times [2025-01-09 10:10:15,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:15,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89707747] [2025-01-09 10:10:15,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:15,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:15,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-01-09 10:10:15,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-01-09 10:10:15,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:15,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:16,000 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-01-09 10:10:16,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:16,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89707747] [2025-01-09 10:10:16,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89707747] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:16,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:16,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:10:16,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157607] [2025-01-09 10:10:16,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:16,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:10:16,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:16,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:10:16,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:10:16,003 INFO L87 Difference]: Start difference. First operand 3330 states and 5660 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-01-09 10:10:16,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:16,785 INFO L93 Difference]: Finished difference Result 10494 states and 17639 transitions. [2025-01-09 10:10:16,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:10:16,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 688 [2025-01-09 10:10:16,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:16,833 INFO L225 Difference]: With dead ends: 10494 [2025-01-09 10:10:16,834 INFO L226 Difference]: Without dead ends: 7242 [2025-01-09 10:10:16,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:10:16,847 INFO L435 NwaCegarLoop]: 1078 mSDtfsCounter, 665 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 2341 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:16,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 2341 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:10:16,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7242 states. [2025-01-09 10:10:17,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7242 to 5661. [2025-01-09 10:10:17,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5661 states, 4520 states have (on average 1.6298672566371681) internal successors, (7367), 4538 states have internal predecessors, (7367), 1094 states have call successors, (1094), 46 states have call predecessors, (1094), 46 states have return successors, (1094), 1076 states have call predecessors, (1094), 1094 states have call successors, (1094) [2025-01-09 10:10:17,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5661 states to 5661 states and 9555 transitions. [2025-01-09 10:10:17,161 INFO L78 Accepts]: Start accepts. Automaton has 5661 states and 9555 transitions. Word has length 688 [2025-01-09 10:10:17,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:17,162 INFO L471 AbstractCegarLoop]: Abstraction has 5661 states and 9555 transitions. [2025-01-09 10:10:17,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-01-09 10:10:17,163 INFO L276 IsEmpty]: Start isEmpty. Operand 5661 states and 9555 transitions. [2025-01-09 10:10:17,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-01-09 10:10:17,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:17,171 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:10:17,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:10:17,172 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:17,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:17,172 INFO L85 PathProgramCache]: Analyzing trace with hash 855904326, now seen corresponding path program 1 times [2025-01-09 10:10:17,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:17,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551681737] [2025-01-09 10:10:17,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:17,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:17,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-01-09 10:10:17,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-01-09 10:10:17,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:17,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:17,708 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-01-09 10:10:17,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:17,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551681737] [2025-01-09 10:10:17,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551681737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:17,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:17,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:10:17,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854581868] [2025-01-09 10:10:17,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:17,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:10:17,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:17,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:10:17,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:10:17,711 INFO L87 Difference]: Start difference. First operand 5661 states and 9555 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 2 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 2 states have call predecessors, (106), 2 states have call successors, (106) [2025-01-09 10:10:18,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:18,802 INFO L93 Difference]: Finished difference Result 21259 states and 35973 transitions. [2025-01-09 10:10:18,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:10:18,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 2 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 2 states have call predecessors, (106), 2 states have call successors, (106) Word has length 688 [2025-01-09 10:10:18,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:18,856 INFO L225 Difference]: With dead ends: 21259 [2025-01-09 10:10:18,856 INFO L226 Difference]: Without dead ends: 15676 [2025-01-09 10:10:18,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 10:10:18,873 INFO L435 NwaCegarLoop]: 1120 mSDtfsCounter, 890 mSDsluCounter, 2738 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 3858 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:18,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 3858 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 10:10:18,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15676 states. [2025-01-09 10:10:19,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15676 to 10919. [2025-01-09 10:10:19,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10919 states, 8752 states have (on average 1.631284277879342) internal successors, (14277), 8786 states have internal predecessors, (14277), 2080 states have call successors, (2080), 86 states have call predecessors, (2080), 86 states have return successors, (2080), 2046 states have call predecessors, (2080), 2080 states have call successors, (2080) [2025-01-09 10:10:19,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10919 states to 10919 states and 18437 transitions. [2025-01-09 10:10:19,589 INFO L78 Accepts]: Start accepts. Automaton has 10919 states and 18437 transitions. Word has length 688 [2025-01-09 10:10:19,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:19,590 INFO L471 AbstractCegarLoop]: Abstraction has 10919 states and 18437 transitions. [2025-01-09 10:10:19,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 2 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 2 states have call predecessors, (106), 2 states have call successors, (106) [2025-01-09 10:10:19,591 INFO L276 IsEmpty]: Start isEmpty. Operand 10919 states and 18437 transitions. [2025-01-09 10:10:19,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2025-01-09 10:10:19,607 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:19,608 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:10:19,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:10:19,608 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:19,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:19,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1060926879, now seen corresponding path program 1 times [2025-01-09 10:10:19,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:19,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956570681] [2025-01-09 10:10:19,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:19,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:19,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 689 statements into 1 equivalence classes. [2025-01-09 10:10:19,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 689 of 689 statements. [2025-01-09 10:10:19,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:19,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:19,944 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-01-09 10:10:19,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:19,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956570681] [2025-01-09 10:10:19,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956570681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:19,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:19,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:10:19,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407217527] [2025-01-09 10:10:19,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:19,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:10:19,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:19,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:10:19,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:10:19,947 INFO L87 Difference]: Start difference. First operand 10919 states and 18437 transitions. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-01-09 10:10:20,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:20,560 INFO L93 Difference]: Finished difference Result 28273 states and 47941 transitions. [2025-01-09 10:10:20,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:10:20,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 689 [2025-01-09 10:10:20,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:20,615 INFO L225 Difference]: With dead ends: 28273 [2025-01-09 10:10:20,616 INFO L226 Difference]: Without dead ends: 17432 [2025-01-09 10:10:20,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:10:20,645 INFO L435 NwaCegarLoop]: 688 mSDtfsCounter, 398 mSDsluCounter, 1813 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 2501 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:20,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 2501 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:10:20,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17432 states. [2025-01-09 10:10:21,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17432 to 17393. [2025-01-09 10:10:21,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17393 states, 14476 states have (on average 1.6547388781431334) internal successors, (23954), 14535 states have internal predecessors, (23954), 2805 states have call successors, (2805), 111 states have call predecessors, (2805), 111 states have return successors, (2805), 2746 states have call predecessors, (2805), 2805 states have call successors, (2805) [2025-01-09 10:10:21,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17393 states to 17393 states and 29564 transitions. [2025-01-09 10:10:21,346 INFO L78 Accepts]: Start accepts. Automaton has 17393 states and 29564 transitions. Word has length 689 [2025-01-09 10:10:21,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:21,347 INFO L471 AbstractCegarLoop]: Abstraction has 17393 states and 29564 transitions. [2025-01-09 10:10:21,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-01-09 10:10:21,347 INFO L276 IsEmpty]: Start isEmpty. Operand 17393 states and 29564 transitions. [2025-01-09 10:10:21,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2025-01-09 10:10:21,368 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:21,368 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:10:21,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:10:21,369 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:21,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:21,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1948149725, now seen corresponding path program 1 times [2025-01-09 10:10:21,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:21,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107984743] [2025-01-09 10:10:21,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:21,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:21,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 689 statements into 1 equivalence classes. [2025-01-09 10:10:21,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 689 of 689 statements. [2025-01-09 10:10:21,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:21,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:22,548 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-01-09 10:10:22,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:22,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107984743] [2025-01-09 10:10:22,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107984743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:22,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:22,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:10:22,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483055172] [2025-01-09 10:10:22,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:22,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:10:22,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:22,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:10:22,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:10:22,551 INFO L87 Difference]: Start difference. First operand 17393 states and 29564 transitions. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-01-09 10:10:24,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:24,523 INFO L93 Difference]: Finished difference Result 47575 states and 81059 transitions. [2025-01-09 10:10:24,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:10:24,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 689 [2025-01-09 10:10:24,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:24,652 INFO L225 Difference]: With dead ends: 47575 [2025-01-09 10:10:24,652 INFO L226 Difference]: Without dead ends: 39352 [2025-01-09 10:10:24,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:10:24,689 INFO L435 NwaCegarLoop]: 1145 mSDtfsCounter, 804 mSDsluCounter, 1896 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 3041 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:24,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 3041 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:10:24,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39352 states. [2025-01-09 10:10:25,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39352 to 17553. [2025-01-09 10:10:25,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17553 states, 14636 states have (on average 1.653935501503143) internal successors, (24207), 14695 states have internal predecessors, (24207), 2805 states have call successors, (2805), 111 states have call predecessors, (2805), 111 states have return successors, (2805), 2746 states have call predecessors, (2805), 2805 states have call successors, (2805) [2025-01-09 10:10:25,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17553 states to 17553 states and 29817 transitions. [2025-01-09 10:10:25,570 INFO L78 Accepts]: Start accepts. Automaton has 17553 states and 29817 transitions. Word has length 689 [2025-01-09 10:10:25,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:25,571 INFO L471 AbstractCegarLoop]: Abstraction has 17553 states and 29817 transitions. [2025-01-09 10:10:25,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-01-09 10:10:25,571 INFO L276 IsEmpty]: Start isEmpty. Operand 17553 states and 29817 transitions. [2025-01-09 10:10:25,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2025-01-09 10:10:25,588 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:25,588 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:10:25,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:10:25,588 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:25,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:25,589 INFO L85 PathProgramCache]: Analyzing trace with hash 2001318062, now seen corresponding path program 1 times [2025-01-09 10:10:25,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:25,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399351441] [2025-01-09 10:10:25,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:25,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:25,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 690 statements into 1 equivalence classes. [2025-01-09 10:10:25,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 690 of 690 statements. [2025-01-09 10:10:25,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:25,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:25,988 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-01-09 10:10:25,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:25,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399351441] [2025-01-09 10:10:25,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399351441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:25,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:25,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:10:25,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013563586] [2025-01-09 10:10:25,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:25,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:10:25,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:25,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:10:25,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:10:25,990 INFO L87 Difference]: Start difference. First operand 17553 states and 29817 transitions. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-01-09 10:10:27,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:27,005 INFO L93 Difference]: Finished difference Result 40380 states and 68314 transitions. [2025-01-09 10:10:27,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 10:10:27,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 690 [2025-01-09 10:10:27,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:27,072 INFO L225 Difference]: With dead ends: 40380 [2025-01-09 10:10:27,072 INFO L226 Difference]: Without dead ends: 22905 [2025-01-09 10:10:27,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 10:10:27,101 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 1311 mSDsluCounter, 2478 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1311 SdHoareTripleChecker+Valid, 3272 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:27,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1311 Valid, 3272 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:10:27,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22905 states. [2025-01-09 10:10:27,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22905 to 18980. [2025-01-09 10:10:27,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18980 states, 15679 states have (on average 1.6441099559920913) internal successors, (25778), 15745 states have internal predecessors, (25778), 3160 states have call successors, (3160), 140 states have call predecessors, (3160), 140 states have return successors, (3160), 3094 states have call predecessors, (3160), 3160 states have call successors, (3160) [2025-01-09 10:10:27,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18980 states to 18980 states and 32098 transitions. [2025-01-09 10:10:27,934 INFO L78 Accepts]: Start accepts. Automaton has 18980 states and 32098 transitions. Word has length 690 [2025-01-09 10:10:27,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:27,934 INFO L471 AbstractCegarLoop]: Abstraction has 18980 states and 32098 transitions. [2025-01-09 10:10:27,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-01-09 10:10:27,935 INFO L276 IsEmpty]: Start isEmpty. Operand 18980 states and 32098 transitions. [2025-01-09 10:10:27,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2025-01-09 10:10:27,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:27,954 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:10:27,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:10:27,955 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:27,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:27,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2028383664, now seen corresponding path program 1 times [2025-01-09 10:10:27,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:27,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240317443] [2025-01-09 10:10:27,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:27,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:27,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 690 statements into 1 equivalence classes. [2025-01-09 10:10:28,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 690 of 690 statements. [2025-01-09 10:10:28,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:28,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:32,451 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-01-09 10:10:32,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:32,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240317443] [2025-01-09 10:10:32,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240317443] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:32,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:32,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 10:10:32,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417441378] [2025-01-09 10:10:32,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:32,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 10:10:32,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:32,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 10:10:32,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:10:32,453 INFO L87 Difference]: Start difference. First operand 18980 states and 32098 transitions. Second operand has 10 states, 10 states have (on average 16.3) internal successors, (163), 10 states have internal predecessors, (163), 2 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 2 states have call predecessors, (106), 2 states have call successors, (106) [2025-01-09 10:10:43,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:43,582 INFO L93 Difference]: Finished difference Result 110701 states and 186980 transitions. [2025-01-09 10:10:43,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 10:10:43,582 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.3) internal successors, (163), 10 states have internal predecessors, (163), 2 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 2 states have call predecessors, (106), 2 states have call successors, (106) Word has length 690 [2025-01-09 10:10:43,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:44,061 INFO L225 Difference]: With dead ends: 110701 [2025-01-09 10:10:44,061 INFO L226 Difference]: Without dead ends: 91803 [2025-01-09 10:10:44,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:10:44,103 INFO L435 NwaCegarLoop]: 1022 mSDtfsCounter, 5263 mSDsluCounter, 3494 mSDsCounter, 0 mSdLazyCounter, 2011 mSolverCounterSat, 982 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5263 SdHoareTripleChecker+Valid, 4516 SdHoareTripleChecker+Invalid, 2993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 982 IncrementalHoareTripleChecker+Valid, 2011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:44,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5263 Valid, 4516 Invalid, 2993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [982 Valid, 2011 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-01-09 10:10:44,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91803 states. [2025-01-09 10:10:49,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91803 to 51969. [2025-01-09 10:10:50,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51969 states, 43220 states have (on average 1.6419250347061545) internal successors, (70964), 43422 states have internal predecessors, (70964), 8344 states have call successors, (8344), 404 states have call predecessors, (8344), 404 states have return successors, (8344), 8142 states have call predecessors, (8344), 8344 states have call successors, (8344) [2025-01-09 10:10:50,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51969 states to 51969 states and 87652 transitions. [2025-01-09 10:10:50,232 INFO L78 Accepts]: Start accepts. Automaton has 51969 states and 87652 transitions. Word has length 690 [2025-01-09 10:10:50,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:50,233 INFO L471 AbstractCegarLoop]: Abstraction has 51969 states and 87652 transitions. [2025-01-09 10:10:50,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.3) internal successors, (163), 10 states have internal predecessors, (163), 2 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 2 states have call predecessors, (106), 2 states have call successors, (106) [2025-01-09 10:10:50,233 INFO L276 IsEmpty]: Start isEmpty. Operand 51969 states and 87652 transitions. [2025-01-09 10:10:50,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2025-01-09 10:10:50,275 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:50,275 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:10:50,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:10:50,276 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:50,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:50,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1189995925, now seen corresponding path program 1 times [2025-01-09 10:10:50,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:50,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380696622] [2025-01-09 10:10:50,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:50,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:50,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 690 statements into 1 equivalence classes. [2025-01-09 10:10:50,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 690 of 690 statements. [2025-01-09 10:10:50,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:50,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:53,451 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-01-09 10:10:53,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:53,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380696622] [2025-01-09 10:10:53,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380696622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:10:53,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:10:53,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 10:10:53,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812343074] [2025-01-09 10:10:53,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:10:53,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 10:10:53,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:53,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 10:10:53,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 10:10:53,453 INFO L87 Difference]: Start difference. First operand 51969 states and 87652 transitions. Second operand has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-01-09 10:11:13,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:11:13,674 INFO L93 Difference]: Finished difference Result 263304 states and 444595 transitions. [2025-01-09 10:11:13,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 10:11:13,674 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 690 [2025-01-09 10:11:13,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:11:14,179 INFO L225 Difference]: With dead ends: 263304 [2025-01-09 10:11:14,179 INFO L226 Difference]: Without dead ends: 211417 [2025-01-09 10:11:14,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-01-09 10:11:14,278 INFO L435 NwaCegarLoop]: 1225 mSDtfsCounter, 5263 mSDsluCounter, 3225 mSDsCounter, 0 mSdLazyCounter, 1438 mSolverCounterSat, 601 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5263 SdHoareTripleChecker+Valid, 4450 SdHoareTripleChecker+Invalid, 2039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 601 IncrementalHoareTripleChecker+Valid, 1438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-09 10:11:14,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5263 Valid, 4450 Invalid, 2039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [601 Valid, 1438 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-09 10:11:14,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211417 states.