./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-39.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-39.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 0c706fa91314fb7243238e5d29e01d46b95186e40d523a8cf8bc9817d5b008da --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:04:32,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:04:32,314 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:04:32,317 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:04:32,318 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:04:32,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:04:32,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:04:32,348 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:04:32,348 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:04:32,348 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:04:32,349 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:04:32,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:04:32,349 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:04:32,349 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:04:32,349 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:04:32,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:04:32,350 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:04:32,350 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:04:32,350 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:04:32,350 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:04:32,350 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:04:32,350 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:04:32,350 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:04:32,350 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:04:32,350 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:04:32,350 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:04:32,350 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:04:32,350 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:04:32,350 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:04:32,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:04:32,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:04:32,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:04:32,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:04:32,351 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:04:32,351 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:04:32,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:04:32,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:04:32,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:04:32,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:04:32,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:04:32,351 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:04:32,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:04:32,351 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:04:32,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:04:32,352 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:04:32,352 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:04:32,352 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:04:32,352 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:04:32,352 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 -> 0c706fa91314fb7243238e5d29e01d46b95186e40d523a8cf8bc9817d5b008da [2025-01-09 10:04:32,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:04:32,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:04:32,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:04:32,553 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:04:32,553 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:04:32,554 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-39.i [2025-01-09 10:04:33,701 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d892b6012/20367d10a3a04533a3ba50376ac488cc/FLAG0e8c64f6c [2025-01-09 10:04:34,116 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:04:34,117 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-39.i [2025-01-09 10:04:34,143 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d892b6012/20367d10a3a04533a3ba50376ac488cc/FLAG0e8c64f6c [2025-01-09 10:04:34,166 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d892b6012/20367d10a3a04533a3ba50376ac488cc [2025-01-09 10:04:34,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:04:34,175 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:04:34,176 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:04:34,176 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:04:34,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:04:34,182 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:04:34" (1/1) ... [2025-01-09 10:04:34,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a285505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:34, skipping insertion in model container [2025-01-09 10:04:34,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:04:34" (1/1) ... [2025-01-09 10:04:34,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:04:34,330 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-39.i[916,929] [2025-01-09 10:04:34,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:04:34,506 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:04:34,514 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-39.i[916,929] [2025-01-09 10:04:34,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:04:34,572 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:04:34,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:34 WrapperNode [2025-01-09 10:04:34,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:04:34,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:04:34,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:04:34,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:04:34,578 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:04:34" (1/1) ... [2025-01-09 10:04:34,589 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:04:34" (1/1) ... [2025-01-09 10:04:34,639 INFO L138 Inliner]: procedures = 26, calls = 120, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 823 [2025-01-09 10:04:34,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:04:34,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:04:34,640 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:04:34,640 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:04:34,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:34" (1/1) ... [2025-01-09 10:04:34,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:34" (1/1) ... [2025-01-09 10:04:34,651 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:34" (1/1) ... [2025-01-09 10:04:34,667 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:04:34,667 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:34" (1/1) ... [2025-01-09 10:04:34,667 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:34" (1/1) ... [2025-01-09 10:04:34,678 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:34" (1/1) ... [2025-01-09 10:04:34,680 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:34" (1/1) ... [2025-01-09 10:04:34,688 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:34" (1/1) ... [2025-01-09 10:04:34,691 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:34" (1/1) ... [2025-01-09 10:04:34,693 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:34" (1/1) ... [2025-01-09 10:04:34,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:04:34,698 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:04:34,698 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:04:34,698 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:04:34,699 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:34" (1/1) ... [2025-01-09 10:04:34,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:04:34,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:04:34,727 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:04:34,730 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:04:34,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:04:34,747 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:04:34,747 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:04:34,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:04:34,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:04:34,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:04:34,854 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:04:34,856 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:04:35,831 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-01-09 10:04:35,831 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:04:35,848 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:04:35,849 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:04:35,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:04:35 BoogieIcfgContainer [2025-01-09 10:04:35,850 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:04:35,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:04:35,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:04:35,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:04:35,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:04:34" (1/3) ... [2025-01-09 10:04:35,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca54cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:04:35, skipping insertion in model container [2025-01-09 10:04:35,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:34" (2/3) ... [2025-01-09 10:04:35,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca54cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:04:35, skipping insertion in model container [2025-01-09 10:04:35,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:04:35" (3/3) ... [2025-01-09 10:04:35,858 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-39.i [2025-01-09 10:04:35,868 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:04:35,870 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-39.i that has 2 procedures, 344 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:04:35,921 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:04:35,930 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;@27ef091b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:04:35,931 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:04:35,934 INFO L276 IsEmpty]: Start isEmpty. Operand has 344 states, 234 states have (on average 1.5726495726495726) internal successors, (368), 235 states have internal predecessors, (368), 107 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 107 states have call predecessors, (107), 107 states have call successors, (107) [2025-01-09 10:04:35,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-01-09 10:04:35,958 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:35,959 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:35,959 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:35,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:35,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1173891246, now seen corresponding path program 1 times [2025-01-09 10:04:35,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:35,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789472823] [2025-01-09 10:04:35,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:35,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:36,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-01-09 10:04:36,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-01-09 10:04:36,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:36,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:36,545 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 22472 trivial. 0 not checked. [2025-01-09 10:04:36,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:36,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789472823] [2025-01-09 10:04:36,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789472823] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:04:36,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355359790] [2025-01-09 10:04:36,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:36,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:04:36,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:04:36,553 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:04:36,558 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:04:36,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-01-09 10:04:36,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-01-09 10:04:36,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:36,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:36,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 1583 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:04:36,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:04:37,025 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 22472 trivial. 0 not checked. [2025-01-09 10:04:37,026 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:04:37,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355359790] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:37,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:04:37,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:04:37,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440131321] [2025-01-09 10:04:37,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:37,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:04:37,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:37,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:04:37,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:04:37,054 INFO L87 Difference]: Start difference. First operand has 344 states, 234 states have (on average 1.5726495726495726) internal successors, (368), 235 states have internal predecessors, (368), 107 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 107 states have call predecessors, (107), 107 states have call successors, (107) 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, (107), 2 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 2 states have call successors, (107) [2025-01-09 10:04:37,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:37,125 INFO L93 Difference]: Finished difference Result 682 states and 1266 transitions. [2025-01-09 10:04:37,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:04:37,127 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, (107), 2 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 2 states have call successors, (107) Word has length 692 [2025-01-09 10:04:37,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:37,134 INFO L225 Difference]: With dead ends: 682 [2025-01-09 10:04:37,134 INFO L226 Difference]: Without dead ends: 341 [2025-01-09 10:04:37,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 693 GetRequests, 693 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:04:37,140 INFO L435 NwaCegarLoop]: 577 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, 577 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:04:37,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:37,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-01-09 10:04:37,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2025-01-09 10:04:37,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 232 states have (on average 1.5646551724137931) internal successors, (363), 232 states have internal predecessors, (363), 107 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 107 states have call predecessors, (107), 107 states have call successors, (107) [2025-01-09 10:04:37,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 577 transitions. [2025-01-09 10:04:37,211 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 577 transitions. Word has length 692 [2025-01-09 10:04:37,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:37,211 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 577 transitions. [2025-01-09 10:04:37,212 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, (107), 2 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 2 states have call successors, (107) [2025-01-09 10:04:37,212 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 577 transitions. [2025-01-09 10:04:37,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-01-09 10:04:37,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:37,225 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:37,237 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:04:37,429 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:04:37,430 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:37,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:37,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1999862864, now seen corresponding path program 1 times [2025-01-09 10:04:37,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:37,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081347885] [2025-01-09 10:04:37,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:37,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:37,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-01-09 10:04:37,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-01-09 10:04:37,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:37,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:38,115 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-01-09 10:04:38,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:38,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081347885] [2025-01-09 10:04:38,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081347885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:38,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:38,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:04:38,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422801300] [2025-01-09 10:04:38,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:38,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:04:38,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:38,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:04:38,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:38,120 INFO L87 Difference]: Start difference. First operand 341 states and 577 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, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:04:38,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:38,222 INFO L93 Difference]: Finished difference Result 870 states and 1484 transitions. [2025-01-09 10:04:38,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:04:38,222 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, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 692 [2025-01-09 10:04:38,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:38,227 INFO L225 Difference]: With dead ends: 870 [2025-01-09 10:04:38,227 INFO L226 Difference]: Without dead ends: 532 [2025-01-09 10:04:38,228 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:04:38,229 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 325 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:38,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 1175 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:04:38,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-01-09 10:04:38,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 529. [2025-01-09 10:04:38,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 403 states have (on average 1.6253101736972704) internal successors, (655), 404 states have internal predecessors, (655), 123 states have call successors, (123), 2 states have call predecessors, (123), 2 states have return successors, (123), 122 states have call predecessors, (123), 123 states have call successors, (123) [2025-01-09 10:04:38,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 901 transitions. [2025-01-09 10:04:38,287 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 901 transitions. Word has length 692 [2025-01-09 10:04:38,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:38,288 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 901 transitions. [2025-01-09 10:04:38,288 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, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:04:38,288 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 901 transitions. [2025-01-09 10:04:38,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-01-09 10:04:38,298 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:38,298 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:38,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:04:38,298 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:38,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:38,299 INFO L85 PathProgramCache]: Analyzing trace with hash 102419660, now seen corresponding path program 1 times [2025-01-09 10:04:38,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:38,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158066331] [2025-01-09 10:04:38,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:38,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:38,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-01-09 10:04:38,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-01-09 10:04:38,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:38,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:38,705 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-01-09 10:04:38,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:38,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158066331] [2025-01-09 10:04:38,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158066331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:38,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:38,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:04:38,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933070889] [2025-01-09 10:04:38,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:38,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:04:38,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:38,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:04:38,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:38,708 INFO L87 Difference]: Start difference. First operand 529 states and 901 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, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:04:38,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:38,760 INFO L93 Difference]: Finished difference Result 1237 states and 2090 transitions. [2025-01-09 10:04:38,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:04:38,767 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, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 692 [2025-01-09 10:04:38,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:38,778 INFO L225 Difference]: With dead ends: 1237 [2025-01-09 10:04:38,778 INFO L226 Difference]: Without dead ends: 711 [2025-01-09 10:04:38,780 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:04:38,780 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 565 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:38,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 1142 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:38,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-01-09 10:04:38,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 529. [2025-01-09 10:04:38,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 403 states have (on average 1.6153846153846154) internal successors, (651), 404 states have internal predecessors, (651), 123 states have call successors, (123), 2 states have call predecessors, (123), 2 states have return successors, (123), 122 states have call predecessors, (123), 123 states have call successors, (123) [2025-01-09 10:04:38,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 897 transitions. [2025-01-09 10:04:38,845 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 897 transitions. Word has length 692 [2025-01-09 10:04:38,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:38,846 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 897 transitions. [2025-01-09 10:04:38,847 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, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:04:38,847 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 897 transitions. [2025-01-09 10:04:38,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-01-09 10:04:38,855 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:38,855 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:38,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:04:38,856 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:38,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:38,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1723893592, now seen corresponding path program 1 times [2025-01-09 10:04:38,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:38,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710851833] [2025-01-09 10:04:38,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:38,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:38,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-01-09 10:04:38,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-01-09 10:04:38,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:38,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:39,129 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-01-09 10:04:39,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:39,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710851833] [2025-01-09 10:04:39,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710851833] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:39,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:39,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:04:39,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990343484] [2025-01-09 10:04:39,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:39,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:04:39,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:39,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:04:39,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:39,135 INFO L87 Difference]: Start difference. First operand 529 states and 897 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, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:04:39,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:39,178 INFO L93 Difference]: Finished difference Result 1391 states and 2347 transitions. [2025-01-09 10:04:39,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:04:39,179 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, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 693 [2025-01-09 10:04:39,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:39,184 INFO L225 Difference]: With dead ends: 1391 [2025-01-09 10:04:39,184 INFO L226 Difference]: Without dead ends: 865 [2025-01-09 10:04:39,185 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:04:39,186 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 361 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:39,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1137 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:39,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2025-01-09 10:04:39,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 862. [2025-01-09 10:04:39,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 629 states have (on average 1.5786963434022259) internal successors, (993), 632 states have internal predecessors, (993), 228 states have call successors, (228), 4 states have call predecessors, (228), 4 states have return successors, (228), 225 states have call predecessors, (228), 228 states have call successors, (228) [2025-01-09 10:04:39,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1449 transitions. [2025-01-09 10:04:39,243 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1449 transitions. Word has length 693 [2025-01-09 10:04:39,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:39,244 INFO L471 AbstractCegarLoop]: Abstraction has 862 states and 1449 transitions. [2025-01-09 10:04:39,244 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, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:04:39,244 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1449 transitions. [2025-01-09 10:04:39,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-01-09 10:04:39,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:39,253 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:39,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:04:39,253 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:39,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:39,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1869473830, now seen corresponding path program 1 times [2025-01-09 10:04:39,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:39,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157865726] [2025-01-09 10:04:39,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:39,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:39,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-01-09 10:04:39,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-01-09 10:04:39,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:39,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:39,494 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-01-09 10:04:39,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:39,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157865726] [2025-01-09 10:04:39,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157865726] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:39,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:39,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:04:39,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608596943] [2025-01-09 10:04:39,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:39,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:04:39,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:39,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:04:39,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:39,496 INFO L87 Difference]: Start difference. First operand 862 states and 1449 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, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:04:39,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:39,581 INFO L93 Difference]: Finished difference Result 2580 states and 4341 transitions. [2025-01-09 10:04:39,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:04:39,582 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, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 693 [2025-01-09 10:04:39,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:39,592 INFO L225 Difference]: With dead ends: 2580 [2025-01-09 10:04:39,592 INFO L226 Difference]: Without dead ends: 1721 [2025-01-09 10:04:39,595 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:04:39,596 INFO L435 NwaCegarLoop]: 1063 mSDtfsCounter, 566 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:39,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1632 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:39,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2025-01-09 10:04:39,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1719. [2025-01-09 10:04:39,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1719 states, 1254 states have (on average 1.5741626794258374) internal successors, (1974), 1260 states have internal predecessors, (1974), 456 states have call successors, (456), 8 states have call predecessors, (456), 8 states have return successors, (456), 450 states have call predecessors, (456), 456 states have call successors, (456) [2025-01-09 10:04:39,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2886 transitions. [2025-01-09 10:04:39,760 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2886 transitions. Word has length 693 [2025-01-09 10:04:39,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:39,761 INFO L471 AbstractCegarLoop]: Abstraction has 1719 states and 2886 transitions. [2025-01-09 10:04:39,762 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, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:04:39,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2886 transitions. [2025-01-09 10:04:39,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-01-09 10:04:39,771 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:39,771 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:39,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:04:39,771 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:39,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:39,772 INFO L85 PathProgramCache]: Analyzing trace with hash -483270436, now seen corresponding path program 1 times [2025-01-09 10:04:39,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:39,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615310013] [2025-01-09 10:04:39,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:39,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:39,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-01-09 10:04:39,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-01-09 10:04:39,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:39,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:40,038 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-01-09 10:04:40,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:40,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615310013] [2025-01-09 10:04:40,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615310013] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:40,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:40,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:04:40,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381511000] [2025-01-09 10:04:40,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:40,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:04:40,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:40,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:04:40,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:40,041 INFO L87 Difference]: Start difference. First operand 1719 states and 2886 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, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:04:40,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:40,163 INFO L93 Difference]: Finished difference Result 5051 states and 8468 transitions. [2025-01-09 10:04:40,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:04:40,163 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, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 693 [2025-01-09 10:04:40,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:40,180 INFO L225 Difference]: With dead ends: 5051 [2025-01-09 10:04:40,180 INFO L226 Difference]: Without dead ends: 3335 [2025-01-09 10:04:40,184 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:04:40,185 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 505 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:40,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 1140 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:40,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2025-01-09 10:04:40,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 2015. [2025-01-09 10:04:40,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2015 states, 1550 states have (on average 1.6219354838709676) internal successors, (2514), 1556 states have internal predecessors, (2514), 456 states have call successors, (456), 8 states have call predecessors, (456), 8 states have return successors, (456), 450 states have call predecessors, (456), 456 states have call successors, (456) [2025-01-09 10:04:40,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 3426 transitions. [2025-01-09 10:04:40,372 INFO L78 Accepts]: Start accepts. Automaton has 2015 states and 3426 transitions. Word has length 693 [2025-01-09 10:04:40,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:40,373 INFO L471 AbstractCegarLoop]: Abstraction has 2015 states and 3426 transitions. [2025-01-09 10:04:40,374 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, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:04:40,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 3426 transitions. [2025-01-09 10:04:40,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-01-09 10:04:40,400 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:40,400 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:40,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:04:40,401 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:40,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:40,401 INFO L85 PathProgramCache]: Analyzing trace with hash -992743526, now seen corresponding path program 1 times [2025-01-09 10:04:40,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:40,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755421987] [2025-01-09 10:04:40,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:40,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:40,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-01-09 10:04:40,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-01-09 10:04:40,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:40,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:40,598 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-01-09 10:04:40,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:40,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755421987] [2025-01-09 10:04:40,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755421987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:40,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:40,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:04:40,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178894978] [2025-01-09 10:04:40,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:40,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:04:40,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:40,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:04:40,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:40,600 INFO L87 Difference]: Start difference. First operand 2015 states and 3426 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, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:04:40,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:40,721 INFO L93 Difference]: Finished difference Result 5455 states and 9296 transitions. [2025-01-09 10:04:40,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:04:40,722 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, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 693 [2025-01-09 10:04:40,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:40,736 INFO L225 Difference]: With dead ends: 5455 [2025-01-09 10:04:40,737 INFO L226 Difference]: Without dead ends: 3443 [2025-01-09 10:04:40,741 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:04:40,741 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 270 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:40,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1114 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:40,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3443 states. [2025-01-09 10:04:40,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3443 to 3437. [2025-01-09 10:04:40,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3437 states, 2776 states have (on average 1.6397694524495676) internal successors, (4552), 2790 states have internal predecessors, (4552), 644 states have call successors, (644), 16 states have call predecessors, (644), 16 states have return successors, (644), 630 states have call predecessors, (644), 644 states have call successors, (644) [2025-01-09 10:04:40,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3437 states to 3437 states and 5840 transitions. [2025-01-09 10:04:40,936 INFO L78 Accepts]: Start accepts. Automaton has 3437 states and 5840 transitions. Word has length 693 [2025-01-09 10:04:40,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:40,937 INFO L471 AbstractCegarLoop]: Abstraction has 3437 states and 5840 transitions. [2025-01-09 10:04:40,937 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, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:04:40,937 INFO L276 IsEmpty]: Start isEmpty. Operand 3437 states and 5840 transitions. [2025-01-09 10:04:40,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-01-09 10:04:40,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:40,942 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:40,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:04:40,943 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:40,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:40,943 INFO L85 PathProgramCache]: Analyzing trace with hash -570041700, now seen corresponding path program 1 times [2025-01-09 10:04:40,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:40,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088271715] [2025-01-09 10:04:40,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:40,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:40,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-01-09 10:04:41,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-01-09 10:04:41,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:41,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:41,132 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-01-09 10:04:41,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:41,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088271715] [2025-01-09 10:04:41,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088271715] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:41,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:41,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:04:41,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203106133] [2025-01-09 10:04:41,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:41,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:04:41,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:41,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:04:41,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:41,134 INFO L87 Difference]: Start difference. First operand 3437 states and 5840 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, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:04:41,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:41,376 INFO L93 Difference]: Finished difference Result 9193 states and 15522 transitions. [2025-01-09 10:04:41,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:04:41,376 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, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 693 [2025-01-09 10:04:41,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:41,406 INFO L225 Difference]: With dead ends: 9193 [2025-01-09 10:04:41,406 INFO L226 Difference]: Without dead ends: 5759 [2025-01-09 10:04:41,414 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:04:41,414 INFO L435 NwaCegarLoop]: 756 mSDtfsCounter, 239 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:41,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 1317 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:41,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5759 states. [2025-01-09 10:04:41,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5759 to 5753. [2025-01-09 10:04:41,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5753 states, 4616 states have (on average 1.6152512998266897) internal successors, (7456), 4646 states have internal predecessors, (7456), 1104 states have call successors, (1104), 32 states have call predecessors, (1104), 32 states have return successors, (1104), 1074 states have call predecessors, (1104), 1104 states have call successors, (1104) [2025-01-09 10:04:41,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5753 states to 5753 states and 9664 transitions. [2025-01-09 10:04:41,807 INFO L78 Accepts]: Start accepts. Automaton has 5753 states and 9664 transitions. Word has length 693 [2025-01-09 10:04:41,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:41,807 INFO L471 AbstractCegarLoop]: Abstraction has 5753 states and 9664 transitions. [2025-01-09 10:04:41,808 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, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:04:41,808 INFO L276 IsEmpty]: Start isEmpty. Operand 5753 states and 9664 transitions. [2025-01-09 10:04:41,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-01-09 10:04:41,815 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:41,815 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:41,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:04:41,815 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:41,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:41,816 INFO L85 PathProgramCache]: Analyzing trace with hash -146394978, now seen corresponding path program 1 times [2025-01-09 10:04:41,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:41,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891840580] [2025-01-09 10:04:41,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:41,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:41,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-01-09 10:04:41,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-01-09 10:04:41,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:41,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:42,411 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-01-09 10:04:42,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:42,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891840580] [2025-01-09 10:04:42,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891840580] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:42,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:42,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:04:42,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703834051] [2025-01-09 10:04:42,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:42,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:04:42,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:42,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:04:42,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:04:42,416 INFO L87 Difference]: Start difference. First operand 5753 states and 9664 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, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:04:43,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:43,513 INFO L93 Difference]: Finished difference Result 19111 states and 31947 transitions. [2025-01-09 10:04:43,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:04:43,514 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, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 693 [2025-01-09 10:04:43,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:43,594 INFO L225 Difference]: With dead ends: 19111 [2025-01-09 10:04:43,594 INFO L226 Difference]: Without dead ends: 12769 [2025-01-09 10:04:43,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:04:43,612 INFO L435 NwaCegarLoop]: 1031 mSDtfsCounter, 863 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:43,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 2159 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 10:04:43,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12769 states. [2025-01-09 10:04:44,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12769 to 9811. [2025-01-09 10:04:44,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9811 states, 8010 states have (on average 1.6172284644194757) internal successors, (12954), 8056 states have internal predecessors, (12954), 1748 states have call successors, (1748), 52 states have call predecessors, (1748), 52 states have return successors, (1748), 1702 states have call predecessors, (1748), 1748 states have call successors, (1748) [2025-01-09 10:04:44,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9811 states to 9811 states and 16450 transitions. [2025-01-09 10:04:44,222 INFO L78 Accepts]: Start accepts. Automaton has 9811 states and 16450 transitions. Word has length 693 [2025-01-09 10:04:44,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:44,223 INFO L471 AbstractCegarLoop]: Abstraction has 9811 states and 16450 transitions. [2025-01-09 10:04:44,224 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, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:04:44,225 INFO L276 IsEmpty]: Start isEmpty. Operand 9811 states and 16450 transitions. [2025-01-09 10:04:44,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-01-09 10:04:44,240 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:44,240 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:44,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:04:44,241 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:44,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:44,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1114522272, now seen corresponding path program 1 times [2025-01-09 10:04:44,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:44,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679859435] [2025-01-09 10:04:44,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:44,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:44,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-01-09 10:04:44,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-01-09 10:04:44,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:44,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:44,874 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-01-09 10:04:44,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:44,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679859435] [2025-01-09 10:04:44,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679859435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:44,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:44,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:04:44,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787091112] [2025-01-09 10:04:44,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:44,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:04:44,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:44,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:04:44,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:04:44,877 INFO L87 Difference]: Start difference. First operand 9811 states and 16450 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, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:04:45,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:45,312 INFO L93 Difference]: Finished difference Result 24524 states and 41177 transitions. [2025-01-09 10:04:45,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:04:45,313 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, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 693 [2025-01-09 10:04:45,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:45,355 INFO L225 Difference]: With dead ends: 24524 [2025-01-09 10:04:45,355 INFO L226 Difference]: Without dead ends: 14716 [2025-01-09 10:04:45,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:04:45,381 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 339 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:45,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 1140 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:04:45,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14716 states. [2025-01-09 10:04:45,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14716 to 14714. [2025-01-09 10:04:45,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14714 states, 12013 states have (on average 1.6126696079247482) internal successors, (19373), 12082 states have internal predecessors, (19373), 2622 states have call successors, (2622), 78 states have call predecessors, (2622), 78 states have return successors, (2622), 2553 states have call predecessors, (2622), 2622 states have call successors, (2622) [2025-01-09 10:04:46,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14714 states to 14714 states and 24617 transitions. [2025-01-09 10:04:46,024 INFO L78 Accepts]: Start accepts. Automaton has 14714 states and 24617 transitions. Word has length 693 [2025-01-09 10:04:46,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:04:46,025 INFO L471 AbstractCegarLoop]: Abstraction has 14714 states and 24617 transitions. [2025-01-09 10:04:46,025 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, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:04:46,025 INFO L276 IsEmpty]: Start isEmpty. Operand 14714 states and 24617 transitions. [2025-01-09 10:04:46,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-01-09 10:04:46,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:04:46,039 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:46,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:04:46,040 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:04:46,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:04:46,041 INFO L85 PathProgramCache]: Analyzing trace with hash -546440736, now seen corresponding path program 1 times [2025-01-09 10:04:46,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:04:46,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073407450] [2025-01-09 10:04:46,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:04:46,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:04:46,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-01-09 10:04:46,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-01-09 10:04:46,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:04:46,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:04:47,544 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-01-09 10:04:47,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:04:47,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073407450] [2025-01-09 10:04:47,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073407450] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:04:47,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:04:47,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 10:04:47,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331758868] [2025-01-09 10:04:47,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:04:47,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 10:04:47,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:04:47,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 10:04:47,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:04:47,546 INFO L87 Difference]: Start difference. First operand 14714 states and 24617 transitions. Second operand has 10 states, 10 states have (on average 16.1) internal successors, (161), 10 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:04:54,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 10:04:58,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:04:58,424 INFO L93 Difference]: Finished difference Result 94258 states and 157985 transitions. [2025-01-09 10:04:58,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 10:04:58,425 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.1) internal successors, (161), 10 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 693 [2025-01-09 10:04:58,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:04:58,645 INFO L225 Difference]: With dead ends: 94258 [2025-01-09 10:04:58,646 INFO L226 Difference]: Without dead ends: 79547 [2025-01-09 10:04:58,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-01-09 10:04:58,700 INFO L435 NwaCegarLoop]: 1080 mSDtfsCounter, 3443 mSDsluCounter, 3758 mSDsCounter, 0 mSdLazyCounter, 2695 mSolverCounterSat, 385 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3443 SdHoareTripleChecker+Valid, 4838 SdHoareTripleChecker+Invalid, 3081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 2695 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2025-01-09 10:04:58,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3443 Valid, 4838 Invalid, 3081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 2695 Invalid, 1 Unknown, 0 Unchecked, 7.7s Time] [2025-01-09 10:04:58,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79547 states. [2025-01-09 10:05:00,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79547 to 42498. [2025-01-09 10:05:00,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42498 states, 35654 states have (on average 1.6287092612329612) internal successors, (58070), 35865 states have internal predecessors, (58070), 6611 states have call successors, (6611), 232 states have call predecessors, (6611), 232 states have return successors, (6611), 6400 states have call predecessors, (6611), 6611 states have call successors, (6611) [2025-01-09 10:05:00,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42498 states to 42498 states and 71292 transitions. [2025-01-09 10:05:00,965 INFO L78 Accepts]: Start accepts. Automaton has 42498 states and 71292 transitions. Word has length 693 [2025-01-09 10:05:00,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:00,966 INFO L471 AbstractCegarLoop]: Abstraction has 42498 states and 71292 transitions. [2025-01-09 10:05:00,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.1) internal successors, (161), 10 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:05:00,966 INFO L276 IsEmpty]: Start isEmpty. Operand 42498 states and 71292 transitions. [2025-01-09 10:05:01,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-01-09 10:05:01,003 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:01,003 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:01,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:05:01,004 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:01,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:01,004 INFO L85 PathProgramCache]: Analyzing trace with hash 502413536, now seen corresponding path program 1 times [2025-01-09 10:05:01,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:01,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54361495] [2025-01-09 10:05:01,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:01,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:01,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-01-09 10:05:01,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-01-09 10:05:01,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:01,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:01,832 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-01-09 10:05:01,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:01,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54361495] [2025-01-09 10:05:01,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54361495] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:01,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:01,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:05:01,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378992005] [2025-01-09 10:05:01,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:01,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:05:01,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:01,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:05:01,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:05:01,835 INFO L87 Difference]: Start difference. First operand 42498 states and 71292 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:05:04,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:04,197 INFO L93 Difference]: Finished difference Result 109651 states and 184344 transitions. [2025-01-09 10:05:04,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 10:05:04,198 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), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 693 [2025-01-09 10:05:04,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:04,376 INFO L225 Difference]: With dead ends: 109651 [2025-01-09 10:05:04,376 INFO L226 Difference]: Without dead ends: 67343 [2025-01-09 10:05:04,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:05:04,452 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 547 mSDsluCounter, 2228 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 2786 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:04,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 2786 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:05:04,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67343 states. [2025-01-09 10:05:06,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67343 to 65829. [2025-01-09 10:05:06,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65829 states, 58985 states have (on average 1.6534712214969907) internal successors, (97530), 59195 states have internal predecessors, (97530), 6611 states have call successors, (6611), 232 states have call predecessors, (6611), 232 states have return successors, (6611), 6401 states have call predecessors, (6611), 6611 states have call successors, (6611) [2025-01-09 10:05:06,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65829 states to 65829 states and 110752 transitions. [2025-01-09 10:05:06,676 INFO L78 Accepts]: Start accepts. Automaton has 65829 states and 110752 transitions. Word has length 693 [2025-01-09 10:05:06,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:06,677 INFO L471 AbstractCegarLoop]: Abstraction has 65829 states and 110752 transitions. [2025-01-09 10:05:06,677 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), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:05:06,677 INFO L276 IsEmpty]: Start isEmpty. Operand 65829 states and 110752 transitions. [2025-01-09 10:05:06,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-01-09 10:05:06,707 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:06,708 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:06,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:05:06,708 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:06,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:06,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1513530786, now seen corresponding path program 1 times [2025-01-09 10:05:06,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:06,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999063554] [2025-01-09 10:05:06,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:06,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:06,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-01-09 10:05:06,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-01-09 10:05:06,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:06,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:07,339 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-01-09 10:05:07,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:07,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999063554] [2025-01-09 10:05:07,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999063554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:07,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:07,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:05:07,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899333310] [2025-01-09 10:05:07,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:07,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:05:07,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:07,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:05:07,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:05:07,342 INFO L87 Difference]: Start difference. First operand 65829 states and 110752 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:05:12,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:12,258 INFO L93 Difference]: Finished difference Result 175377 states and 291485 transitions. [2025-01-09 10:05:12,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 10:05:12,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 693 [2025-01-09 10:05:12,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:12,617 INFO L225 Difference]: With dead ends: 175377 [2025-01-09 10:05:12,618 INFO L226 Difference]: Without dead ends: 128605 [2025-01-09 10:05:12,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:05:12,724 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 1283 mSDsluCounter, 2206 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1283 SdHoareTripleChecker+Valid, 3131 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:12,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1283 Valid, 3131 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 10:05:12,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128605 states. [2025-01-09 10:05:15,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128605 to 83243. [2025-01-09 10:05:15,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83243 states, 76399 states have (on average 1.6717234518776425) internal successors, (127718), 76609 states have internal predecessors, (127718), 6611 states have call successors, (6611), 232 states have call predecessors, (6611), 232 states have return successors, (6611), 6401 states have call predecessors, (6611), 6611 states have call successors, (6611) [2025-01-09 10:05:16,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83243 states to 83243 states and 140940 transitions. [2025-01-09 10:05:16,099 INFO L78 Accepts]: Start accepts. Automaton has 83243 states and 140940 transitions. Word has length 693 [2025-01-09 10:05:16,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:16,102 INFO L471 AbstractCegarLoop]: Abstraction has 83243 states and 140940 transitions. [2025-01-09 10:05:16,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:05:16,103 INFO L276 IsEmpty]: Start isEmpty. Operand 83243 states and 140940 transitions. [2025-01-09 10:05:16,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-01-09 10:05:16,142 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:16,142 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:16,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 10:05:16,143 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:16,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:16,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1654079396, now seen corresponding path program 1 times [2025-01-09 10:05:16,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:16,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603019339] [2025-01-09 10:05:16,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:16,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:16,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-01-09 10:05:16,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-01-09 10:05:16,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:16,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:17,482 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-01-09 10:05:17,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:17,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603019339] [2025-01-09 10:05:17,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603019339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:17,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:17,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:05:17,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620011050] [2025-01-09 10:05:17,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:17,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:05:17,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:17,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:05:17,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:05:17,489 INFO L87 Difference]: Start difference. First operand 83243 states and 140940 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:05:21,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:21,851 INFO L93 Difference]: Finished difference Result 254266 states and 424134 transitions. [2025-01-09 10:05:21,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 10:05:21,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 693 [2025-01-09 10:05:21,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:22,236 INFO L225 Difference]: With dead ends: 254266 [2025-01-09 10:05:22,236 INFO L226 Difference]: Without dead ends: 184397 [2025-01-09 10:05:22,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:05:22,363 INFO L435 NwaCegarLoop]: 916 mSDtfsCounter, 1300 mSDsluCounter, 2236 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1300 SdHoareTripleChecker+Valid, 3152 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:22,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1300 Valid, 3152 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 10:05:22,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184397 states. [2025-01-09 10:05:26,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184397 to 123615. [2025-01-09 10:05:26,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123615 states, 116771 states have (on average 1.673531955708181) internal successors, (195420), 116981 states have internal predecessors, (195420), 6611 states have call successors, (6611), 232 states have call predecessors, (6611), 232 states have return successors, (6611), 6401 states have call predecessors, (6611), 6611 states have call successors, (6611) [2025-01-09 10:05:26,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123615 states to 123615 states and 208642 transitions. [2025-01-09 10:05:26,894 INFO L78 Accepts]: Start accepts. Automaton has 123615 states and 208642 transitions. Word has length 693 [2025-01-09 10:05:26,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:26,895 INFO L471 AbstractCegarLoop]: Abstraction has 123615 states and 208642 transitions. [2025-01-09 10:05:26,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:05:26,895 INFO L276 IsEmpty]: Start isEmpty. Operand 123615 states and 208642 transitions. [2025-01-09 10:05:26,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-01-09 10:05:26,970 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:26,970 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:26,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 10:05:26,971 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:26,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:26,971 INFO L85 PathProgramCache]: Analyzing trace with hash -151358938, now seen corresponding path program 1 times [2025-01-09 10:05:26,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:26,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744642170] [2025-01-09 10:05:26,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:26,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:27,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-01-09 10:05:27,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-01-09 10:05:27,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:27,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:27,414 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-01-09 10:05:27,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:27,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744642170] [2025-01-09 10:05:27,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744642170] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:27,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:27,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:05:27,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441150918] [2025-01-09 10:05:27,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:27,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:05:27,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:27,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:05:27,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:05:27,417 INFO L87 Difference]: Start difference. First operand 123615 states and 208642 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, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:05:31,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:31,435 INFO L93 Difference]: Finished difference Result 255396 states and 431965 transitions. [2025-01-09 10:05:31,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:05:31,435 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, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 693 [2025-01-09 10:05:31,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:31,802 INFO L225 Difference]: With dead ends: 255396 [2025-01-09 10:05:31,802 INFO L226 Difference]: Without dead ends: 175363 [2025-01-09 10:05:31,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:05:31,938 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 1279 mSDsluCounter, 1405 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1279 SdHoareTripleChecker+Valid, 1972 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:31,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1279 Valid, 1972 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:05:32,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175363 states. [2025-01-09 10:05:35,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175363 to 124335. [2025-01-09 10:05:36,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124335 states, 117491 states have (on average 1.6683831101956745) internal successors, (196020), 117701 states have internal predecessors, (196020), 6611 states have call successors, (6611), 232 states have call predecessors, (6611), 232 states have return successors, (6611), 6401 states have call predecessors, (6611), 6611 states have call successors, (6611) [2025-01-09 10:05:36,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124335 states to 124335 states and 209242 transitions. [2025-01-09 10:05:36,307 INFO L78 Accepts]: Start accepts. Automaton has 124335 states and 209242 transitions. Word has length 693 [2025-01-09 10:05:36,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:36,309 INFO L471 AbstractCegarLoop]: Abstraction has 124335 states and 209242 transitions. [2025-01-09 10:05:36,309 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, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:05:36,309 INFO L276 IsEmpty]: Start isEmpty. Operand 124335 states and 209242 transitions. [2025-01-09 10:05:36,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-01-09 10:05:36,373 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:36,373 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:36,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 10:05:36,374 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:36,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:36,375 INFO L85 PathProgramCache]: Analyzing trace with hash -2145503644, now seen corresponding path program 1 times [2025-01-09 10:05:36,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:36,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611241066] [2025-01-09 10:05:36,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:36,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:36,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-01-09 10:05:36,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-01-09 10:05:36,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:36,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:38,750 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-01-09 10:05:38,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:38,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611241066] [2025-01-09 10:05:38,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611241066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:38,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:38,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 10:05:38,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936604319] [2025-01-09 10:05:38,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:38,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 10:05:38,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:38,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 10:05:38,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-09 10:05:38,754 INFO L87 Difference]: Start difference. First operand 124335 states and 209242 transitions. Second operand has 13 states, 13 states have (on average 12.384615384615385) internal successors, (161), 13 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-01-09 10:05:44,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers []