./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-66.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_fillercodestructure_filler-pe-co_file-66.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 e47d94c12124cf4b862c2f881009fef36c28832c985456c790d3472927c1d0c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:55:00,076 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:55:00,132 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:55:00,137 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:55:00,140 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:55:00,161 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:55:00,162 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:55:00,162 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:55:00,162 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:55:00,163 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:55:00,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:55:00,164 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:55:00,164 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:55:00,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:55:00,164 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:55:00,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:55:00,165 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:55:00,165 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:55:00,165 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:55:00,165 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:55:00,165 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:55:00,165 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:55:00,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:55:00,165 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:55:00,165 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:55:00,166 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:55:00,166 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:55:00,166 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:55:00,166 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:55:00,166 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:55:00,166 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:55:00,166 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:55:00,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:55:00,166 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:55:00,167 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:55:00,167 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:55:00,167 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:55:00,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:55:00,167 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:55:00,167 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:55:00,167 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:55:00,167 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:55:00,167 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:55:00,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:55:00,168 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:55:00,168 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:55:00,168 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:55:00,168 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:55:00,168 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 -> e47d94c12124cf4b862c2f881009fef36c28832c985456c790d3472927c1d0c5 [2025-01-09 10:55:00,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:55:00,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:55:00,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:55:00,402 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:55:00,402 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:55:00,404 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-66.i [2025-01-09 10:55:01,618 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68e3b4b0c/6226de9110834652b2a3c70ff4182201/FLAG4272c826f [2025-01-09 10:55:01,895 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:55:01,895 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-66.i [2025-01-09 10:55:01,902 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68e3b4b0c/6226de9110834652b2a3c70ff4182201/FLAG4272c826f [2025-01-09 10:55:02,180 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68e3b4b0c/6226de9110834652b2a3c70ff4182201 [2025-01-09 10:55:02,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:55:02,183 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:55:02,184 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:55:02,184 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:55:02,186 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:55:02,187 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:55:02" (1/1) ... [2025-01-09 10:55:02,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2035306c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:55:02, skipping insertion in model container [2025-01-09 10:55:02,188 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:55:02" (1/1) ... [2025-01-09 10:55:02,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:55:02,349 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_fillercodestructure_filler-pe-co_file-66.i[919,932] [2025-01-09 10:55:02,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:55:02,432 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:55:02,439 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_fillercodestructure_filler-pe-co_file-66.i[919,932] [2025-01-09 10:55:02,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:55:02,465 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:55:02,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:55:02 WrapperNode [2025-01-09 10:55:02,466 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:55:02,467 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:55:02,467 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:55:02,467 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:55:02,471 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:55:02" (1/1) ... [2025-01-09 10:55:02,480 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:55:02" (1/1) ... [2025-01-09 10:55:02,499 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2025-01-09 10:55:02,499 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:55:02,500 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:55:02,500 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:55:02,500 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:55:02,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:55:02" (1/1) ... [2025-01-09 10:55:02,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:55:02" (1/1) ... [2025-01-09 10:55:02,508 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:55:02" (1/1) ... [2025-01-09 10:55:02,518 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:55:02,518 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:55:02" (1/1) ... [2025-01-09 10:55:02,518 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:55:02" (1/1) ... [2025-01-09 10:55:02,523 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:55:02" (1/1) ... [2025-01-09 10:55:02,523 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:55:02" (1/1) ... [2025-01-09 10:55:02,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:55:02" (1/1) ... [2025-01-09 10:55:02,526 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:55:02" (1/1) ... [2025-01-09 10:55:02,527 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:55:02" (1/1) ... [2025-01-09 10:55:02,529 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:55:02,529 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:55:02,529 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:55:02,529 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:55:02,530 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:55:02" (1/1) ... [2025-01-09 10:55:02,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:55:02,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:55:02,560 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:55:02,563 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:55:02,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:55:02,584 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:55:02,584 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:55:02,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:55:02,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:55:02,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:55:02,646 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:55:02,647 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:55:02,900 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 10:55:02,901 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:55:02,910 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:55:02,910 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:55:02,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:55:02 BoogieIcfgContainer [2025-01-09 10:55:02,911 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:55:02,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:55:02,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:55:02,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:55:02,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:55:02" (1/3) ... [2025-01-09 10:55:02,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@376c797d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:55:02, skipping insertion in model container [2025-01-09 10:55:02,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:55:02" (2/3) ... [2025-01-09 10:55:02,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@376c797d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:55:02, skipping insertion in model container [2025-01-09 10:55:02,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:55:02" (3/3) ... [2025-01-09 10:55:02,917 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-66.i [2025-01-09 10:55:02,926 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:55:02,927 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-66.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:55:02,960 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:55:02,967 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;@5a30d1db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:55:02,967 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:55:02,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 10:55:02,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 10:55:02,976 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:55:02,977 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:02,977 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:55:02,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:55:02,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1723549773, now seen corresponding path program 1 times [2025-01-09 10:55:02,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:55:02,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816794345] [2025-01-09 10:55:02,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:55:02,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:55:03,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 10:55:03,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 10:55:03,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:55:03,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:55:03,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-01-09 10:55:03,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:55:03,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816794345] [2025-01-09 10:55:03,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816794345] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:55:03,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374120912] [2025-01-09 10:55:03,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:55:03,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:55:03,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:55:03,231 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:55:03,235 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:55:03,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 10:55:03,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 10:55:03,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:55:03,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:55:03,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:55:03,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:55:03,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-01-09 10:55:03,392 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:55:03,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374120912] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:55:03,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:55:03,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:55:03,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065624934] [2025-01-09 10:55:03,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:55:03,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:55:03,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:55:03,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:55:03,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:55:03,412 INFO L87 Difference]: Start difference. First operand has 83 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 10:55:03,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:55:03,436 INFO L93 Difference]: Finished difference Result 160 states and 281 transitions. [2025-01-09 10:55:03,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:55:03,438 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 160 [2025-01-09 10:55:03,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:55:03,443 INFO L225 Difference]: With dead ends: 160 [2025-01-09 10:55:03,444 INFO L226 Difference]: Without dead ends: 80 [2025-01-09 10:55:03,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 161 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:55:03,449 INFO L435 NwaCegarLoop]: 126 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, 126 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:55:03,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:55:03,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-09 10:55:03,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-01-09 10:55:03,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 10:55:03,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 126 transitions. [2025-01-09 10:55:03,486 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 126 transitions. Word has length 160 [2025-01-09 10:55:03,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:55:03,486 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 126 transitions. [2025-01-09 10:55:03,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 10:55:03,486 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 126 transitions. [2025-01-09 10:55:03,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 10:55:03,492 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:55:03,492 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:03,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 10:55:03,693 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:55:03,694 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:55:03,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:55:03,695 INFO L85 PathProgramCache]: Analyzing trace with hash -2129687441, now seen corresponding path program 1 times [2025-01-09 10:55:03,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:55:03,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256476580] [2025-01-09 10:55:03,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:55:03,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:55:03,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 10:55:03,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 10:55:03,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:55:03,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:55:03,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 10:55:03,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:55:03,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256476580] [2025-01-09 10:55:03,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256476580] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:55:03,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:55:03,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:55:03,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386496520] [2025-01-09 10:55:03,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:55:03,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:55:03,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:55:03,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:55:03,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:55:03,905 INFO L87 Difference]: Start difference. First operand 80 states and 126 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:55:03,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:55:03,972 INFO L93 Difference]: Finished difference Result 232 states and 368 transitions. [2025-01-09 10:55:03,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:55:03,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2025-01-09 10:55:03,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:55:03,979 INFO L225 Difference]: With dead ends: 232 [2025-01-09 10:55:03,979 INFO L226 Difference]: Without dead ends: 155 [2025-01-09 10:55:03,980 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:55:03,980 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 112 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:55:03,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 223 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:55:03,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-01-09 10:55:04,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2025-01-09 10:55:04,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 102 states have (on average 1.392156862745098) internal successors, (142), 102 states have internal predecessors, (142), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 10:55:04,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 238 transitions. [2025-01-09 10:55:04,008 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 238 transitions. Word has length 160 [2025-01-09 10:55:04,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:55:04,009 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 238 transitions. [2025-01-09 10:55:04,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:55:04,009 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 238 transitions. [2025-01-09 10:55:04,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 10:55:04,011 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:55:04,011 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:04,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:55:04,011 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:55:04,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:55:04,012 INFO L85 PathProgramCache]: Analyzing trace with hash -849823763, now seen corresponding path program 1 times [2025-01-09 10:55:04,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:55:04,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545417174] [2025-01-09 10:55:04,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:55:04,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:55:04,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 10:55:04,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 10:55:04,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:55:04,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:55:04,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 10:55:04,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:55:04,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545417174] [2025-01-09 10:55:04,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545417174] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:55:04,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:55:04,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:55:04,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897666240] [2025-01-09 10:55:04,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:55:04,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:55:04,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:55:04,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:55:04,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:55:04,230 INFO L87 Difference]: Start difference. First operand 153 states and 238 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 10:55:04,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:55:04,406 INFO L93 Difference]: Finished difference Result 451 states and 705 transitions. [2025-01-09 10:55:04,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:55:04,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 160 [2025-01-09 10:55:04,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:55:04,409 INFO L225 Difference]: With dead ends: 451 [2025-01-09 10:55:04,409 INFO L226 Difference]: Without dead ends: 301 [2025-01-09 10:55:04,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:55:04,410 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 206 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:55:04,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 213 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:55:04,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-01-09 10:55:04,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 293. [2025-01-09 10:55:04,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 192 states have (on average 1.390625) internal successors, (267), 192 states have internal predecessors, (267), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-01-09 10:55:04,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 459 transitions. [2025-01-09 10:55:04,478 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 459 transitions. Word has length 160 [2025-01-09 10:55:04,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:55:04,478 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 459 transitions. [2025-01-09 10:55:04,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 10:55:04,478 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 459 transitions. [2025-01-09 10:55:04,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 10:55:04,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:55:04,482 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:04,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:55:04,482 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:55:04,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:55:04,483 INFO L85 PathProgramCache]: Analyzing trace with hash -169765393, now seen corresponding path program 1 times [2025-01-09 10:55:04,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:55:04,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653092755] [2025-01-09 10:55:04,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:55:04,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:55:04,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 10:55:04,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 10:55:04,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:55:04,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:55:09,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 10:55:09,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:55:09,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653092755] [2025-01-09 10:55:09,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653092755] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:55:09,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:55:09,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 10:55:09,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286079021] [2025-01-09 10:55:09,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:55:09,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 10:55:09,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:55:09,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 10:55:09,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-01-09 10:55:09,163 INFO L87 Difference]: Start difference. First operand 293 states and 459 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-01-09 10:55:11,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:55:11,629 INFO L93 Difference]: Finished difference Result 1071 states and 1624 transitions. [2025-01-09 10:55:11,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 10:55:11,631 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 160 [2025-01-09 10:55:11,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:55:11,639 INFO L225 Difference]: With dead ends: 1071 [2025-01-09 10:55:11,639 INFO L226 Difference]: Without dead ends: 781 [2025-01-09 10:55:11,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=262, Invalid=730, Unknown=0, NotChecked=0, Total=992 [2025-01-09 10:55:11,644 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 1170 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:55:11,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 431 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 10:55:11,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2025-01-09 10:55:11,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 485. [2025-01-09 10:55:11,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 360 states have (on average 1.4305555555555556) internal successors, (515), 364 states have internal predecessors, (515), 112 states have call successors, (112), 12 states have call predecessors, (112), 12 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2025-01-09 10:55:11,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 739 transitions. [2025-01-09 10:55:11,699 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 739 transitions. Word has length 160 [2025-01-09 10:55:11,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:55:11,700 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 739 transitions. [2025-01-09 10:55:11,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-01-09 10:55:11,700 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 739 transitions. [2025-01-09 10:55:11,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 10:55:11,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:55:11,701 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:11,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:55:11,702 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:55:11,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:55:11,702 INFO L85 PathProgramCache]: Analyzing trace with hash 88400045, now seen corresponding path program 1 times [2025-01-09 10:55:11,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:55:11,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774626992] [2025-01-09 10:55:11,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:55:11,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:55:11,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 10:55:11,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 10:55:11,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:55:11,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:55:15,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 10:55:15,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:55:15,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774626992] [2025-01-09 10:55:15,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774626992] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:55:15,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:55:15,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 10:55:15,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547624692] [2025-01-09 10:55:15,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:55:15,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 10:55:15,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:55:15,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 10:55:15,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:55:15,456 INFO L87 Difference]: Start difference. First operand 485 states and 739 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:55:17,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:55:17,470 INFO L93 Difference]: Finished difference Result 781 states and 1166 transitions. [2025-01-09 10:55:17,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 10:55:17,474 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2025-01-09 10:55:17,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:55:17,479 INFO L225 Difference]: With dead ends: 781 [2025-01-09 10:55:17,480 INFO L226 Difference]: Without dead ends: 779 [2025-01-09 10:55:17,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-01-09 10:55:17,481 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 565 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:55:17,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 604 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 10:55:17,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2025-01-09 10:55:17,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 487. [2025-01-09 10:55:17,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 362 states have (on average 1.430939226519337) internal successors, (518), 366 states have internal predecessors, (518), 112 states have call successors, (112), 12 states have call predecessors, (112), 12 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2025-01-09 10:55:17,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 742 transitions. [2025-01-09 10:55:17,512 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 742 transitions. Word has length 160 [2025-01-09 10:55:17,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:55:17,513 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 742 transitions. [2025-01-09 10:55:17,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:55:17,513 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 742 transitions. [2025-01-09 10:55:17,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 10:55:17,514 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:55:17,514 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:17,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:55:17,515 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:55:17,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:55:17,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1190833747, now seen corresponding path program 1 times [2025-01-09 10:55:17,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:55:17,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260609397] [2025-01-09 10:55:17,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:55:17,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:55:17,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 10:55:17,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 10:55:17,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:55:17,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:55:31,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 10:55:31,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:55:31,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260609397] [2025-01-09 10:55:31,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260609397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:55:31,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:55:31,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 10:55:31,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057189704] [2025-01-09 10:55:31,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:55:31,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 10:55:31,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:55:31,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 10:55:31,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2025-01-09 10:55:31,715 INFO L87 Difference]: Start difference. First operand 487 states and 742 transitions. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-01-09 10:55:34,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:55:34,109 INFO L93 Difference]: Finished difference Result 1311 states and 1941 transitions. [2025-01-09 10:55:34,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 10:55:34,109 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 160 [2025-01-09 10:55:34,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:55:34,113 INFO L225 Difference]: With dead ends: 1311 [2025-01-09 10:55:34,113 INFO L226 Difference]: Without dead ends: 827 [2025-01-09 10:55:34,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=334, Invalid=856, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 10:55:34,115 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 873 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:55:34,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 531 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 10:55:34,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2025-01-09 10:55:34,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 527. [2025-01-09 10:55:34,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 406 states have (on average 1.4261083743842364) internal successors, (579), 410 states have internal predecessors, (579), 104 states have call successors, (104), 16 states have call predecessors, (104), 16 states have return successors, (104), 100 states have call predecessors, (104), 104 states have call successors, (104) [2025-01-09 10:55:34,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 787 transitions. [2025-01-09 10:55:34,165 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 787 transitions. Word has length 160 [2025-01-09 10:55:34,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:55:34,165 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 787 transitions. [2025-01-09 10:55:34,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-01-09 10:55:34,166 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 787 transitions. [2025-01-09 10:55:34,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 10:55:34,167 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:55:34,167 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:34,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:55:34,168 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:55:34,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:55:34,168 INFO L85 PathProgramCache]: Analyzing trace with hash -932668309, now seen corresponding path program 1 times [2025-01-09 10:55:34,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:55:34,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271964808] [2025-01-09 10:55:34,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:55:34,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:55:34,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 10:55:34,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 10:55:34,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:55:34,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:55:45,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 10:55:45,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:55:45,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271964808] [2025-01-09 10:55:45,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271964808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:55:45,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:55:45,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-01-09 10:55:45,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086481577] [2025-01-09 10:55:45,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:55:45,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 10:55:45,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:55:45,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 10:55:45,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-01-09 10:55:45,663 INFO L87 Difference]: Start difference. First operand 527 states and 787 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-01-09 10:55:50,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:55:50,403 INFO L93 Difference]: Finished difference Result 1330 states and 1957 transitions. [2025-01-09 10:55:50,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 10:55:50,407 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 160 [2025-01-09 10:55:50,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:55:50,411 INFO L225 Difference]: With dead ends: 1330 [2025-01-09 10:55:50,411 INFO L226 Difference]: Without dead ends: 806 [2025-01-09 10:55:50,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=356, Invalid=976, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 10:55:50,413 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 884 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 1501 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 1585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:55:50,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 642 Invalid, 1585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1501 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 10:55:50,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2025-01-09 10:55:50,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 522. [2025-01-09 10:55:50,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 401 states have (on average 1.42643391521197) internal successors, (572), 405 states have internal predecessors, (572), 104 states have call successors, (104), 16 states have call predecessors, (104), 16 states have return successors, (104), 100 states have call predecessors, (104), 104 states have call successors, (104) [2025-01-09 10:55:50,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 780 transitions. [2025-01-09 10:55:50,486 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 780 transitions. Word has length 160 [2025-01-09 10:55:50,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:55:50,487 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 780 transitions. [2025-01-09 10:55:50,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-01-09 10:55:50,490 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 780 transitions. [2025-01-09 10:55:50,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 10:55:50,492 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:55:50,492 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:50,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:55:50,492 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:55:50,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:55:50,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1156394483, now seen corresponding path program 1 times [2025-01-09 10:55:50,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:55:50,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860331182] [2025-01-09 10:55:50,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:55:50,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:55:50,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 10:55:50,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 10:55:50,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:55:50,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:55:50,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 10:55:50,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:55:50,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860331182] [2025-01-09 10:55:50,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860331182] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:55:50,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:55:50,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:55:50,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217653215] [2025-01-09 10:55:50,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:55:50,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:55:50,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:55:50,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:55:50,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:55:50,565 INFO L87 Difference]: Start difference. First operand 522 states and 780 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:55:50,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:55:50,791 INFO L93 Difference]: Finished difference Result 1408 states and 2091 transitions. [2025-01-09 10:55:50,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:55:50,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2025-01-09 10:55:50,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:55:50,798 INFO L225 Difference]: With dead ends: 1408 [2025-01-09 10:55:50,798 INFO L226 Difference]: Without dead ends: 889 [2025-01-09 10:55:50,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:55:50,800 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 130 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:55:50,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 469 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:55:50,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2025-01-09 10:55:50,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 748. [2025-01-09 10:55:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 567 states have (on average 1.4232804232804233) internal successors, (807), 573 states have internal predecessors, (807), 156 states have call successors, (156), 24 states have call predecessors, (156), 24 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2025-01-09 10:55:50,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1119 transitions. [2025-01-09 10:55:50,851 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1119 transitions. Word has length 160 [2025-01-09 10:55:50,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:55:50,852 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 1119 transitions. [2025-01-09 10:55:50,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:55:50,852 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1119 transitions. [2025-01-09 10:55:50,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 10:55:50,854 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:55:50,854 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:50,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:55:50,855 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:55:50,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:55:50,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1858709135, now seen corresponding path program 1 times [2025-01-09 10:55:50,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:55:50,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638789985] [2025-01-09 10:55:50,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:55:50,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:55:50,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 10:55:50,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 10:55:50,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:55:50,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:55:50,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 10:55:50,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:55:50,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638789985] [2025-01-09 10:55:50,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638789985] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:55:50,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:55:50,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:55:50,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277294870] [2025-01-09 10:55:50,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:55:50,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:55:50,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:55:50,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:55:50,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:55:50,889 INFO L87 Difference]: Start difference. First operand 748 states and 1119 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:55:50,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:55:50,953 INFO L93 Difference]: Finished difference Result 1456 states and 2178 transitions. [2025-01-09 10:55:50,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:55:50,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2025-01-09 10:55:50,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:55:50,956 INFO L225 Difference]: With dead ends: 1456 [2025-01-09 10:55:50,957 INFO L226 Difference]: Without dead ends: 711 [2025-01-09 10:55:50,959 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:55:50,960 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 109 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:55:50,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 330 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:55:50,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-01-09 10:55:51,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 708. [2025-01-09 10:55:51,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 529 states have (on average 1.3383742911153118) internal successors, (708), 534 states have internal predecessors, (708), 154 states have call successors, (154), 24 states have call predecessors, (154), 24 states have return successors, (154), 149 states have call predecessors, (154), 154 states have call successors, (154) [2025-01-09 10:55:51,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1016 transitions. [2025-01-09 10:55:51,007 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1016 transitions. Word has length 160 [2025-01-09 10:55:51,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:55:51,007 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 1016 transitions. [2025-01-09 10:55:51,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:55:51,007 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1016 transitions. [2025-01-09 10:55:51,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 10:55:51,009 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:55:51,010 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:51,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:55:51,010 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:55:51,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:55:51,010 INFO L85 PathProgramCache]: Analyzing trace with hash 135326129, now seen corresponding path program 1 times [2025-01-09 10:55:51,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:55:51,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703615524] [2025-01-09 10:55:51,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:55:51,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:55:51,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 10:55:51,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 10:55:51,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:55:51,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:55:52,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 10:55:52,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:55:52,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703615524] [2025-01-09 10:55:52,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703615524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:55:52,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:55:52,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 10:55:52,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592023510] [2025-01-09 10:55:52,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:55:52,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 10:55:52,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:55:52,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 10:55:52,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:55:52,279 INFO L87 Difference]: Start difference. First operand 708 states and 1016 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-01-09 10:55:53,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:55:53,360 INFO L93 Difference]: Finished difference Result 1539 states and 2190 transitions. [2025-01-09 10:55:53,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 10:55:53,360 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 160 [2025-01-09 10:55:53,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:55:53,364 INFO L225 Difference]: With dead ends: 1539 [2025-01-09 10:55:53,364 INFO L226 Difference]: Without dead ends: 895 [2025-01-09 10:55:53,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:55:53,366 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 480 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:55:53,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 735 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 10:55:53,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-01-09 10:55:53,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 718. [2025-01-09 10:55:53,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 539 states have (on average 1.3376623376623376) internal successors, (721), 544 states have internal predecessors, (721), 154 states have call successors, (154), 24 states have call predecessors, (154), 24 states have return successors, (154), 149 states have call predecessors, (154), 154 states have call successors, (154) [2025-01-09 10:55:53,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1029 transitions. [2025-01-09 10:55:53,420 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1029 transitions. Word has length 160 [2025-01-09 10:55:53,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:55:53,421 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1029 transitions. [2025-01-09 10:55:53,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-01-09 10:55:53,421 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1029 transitions. [2025-01-09 10:55:53,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 10:55:53,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:55:53,424 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:53,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:55:53,424 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:55:53,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:55:53,424 INFO L85 PathProgramCache]: Analyzing trace with hash -987413843, now seen corresponding path program 1 times [2025-01-09 10:55:53,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:55:53,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157711817] [2025-01-09 10:55:53,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:55:53,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:55:53,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 10:55:53,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 10:55:53,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:55:53,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:55:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 10:55:53,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:55:53,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157711817] [2025-01-09 10:55:53,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157711817] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:55:53,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:55:53,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:55:53,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487529925] [2025-01-09 10:55:53,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:55:53,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:55:53,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:55:53,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:55:53,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:55:53,601 INFO L87 Difference]: Start difference. First operand 718 states and 1029 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 10:55:53,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:55:53,872 INFO L93 Difference]: Finished difference Result 1485 states and 2105 transitions. [2025-01-09 10:55:53,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:55:53,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 160 [2025-01-09 10:55:53,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:55:53,877 INFO L225 Difference]: With dead ends: 1485 [2025-01-09 10:55:53,877 INFO L226 Difference]: Without dead ends: 831 [2025-01-09 10:55:53,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:55:53,880 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 201 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:55:53,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 233 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:55:53,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2025-01-09 10:55:53,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 707. [2025-01-09 10:55:53,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 528 states have (on average 1.331439393939394) internal successors, (703), 533 states have internal predecessors, (703), 154 states have call successors, (154), 24 states have call predecessors, (154), 24 states have return successors, (154), 149 states have call predecessors, (154), 154 states have call successors, (154) [2025-01-09 10:55:53,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1011 transitions. [2025-01-09 10:55:53,943 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1011 transitions. Word has length 160 [2025-01-09 10:55:53,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:55:53,943 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 1011 transitions. [2025-01-09 10:55:53,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 10:55:53,943 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1011 transitions. [2025-01-09 10:55:53,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 10:55:53,945 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:55:53,945 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:53,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:55:53,946 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:55:53,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:55:53,946 INFO L85 PathProgramCache]: Analyzing trace with hash -540899569, now seen corresponding path program 1 times [2025-01-09 10:55:53,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:55:53,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336723061] [2025-01-09 10:55:53,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:55:53,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:55:53,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 10:55:53,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 10:55:53,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:55:53,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:55:54,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 10:55:54,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:55:54,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336723061] [2025-01-09 10:55:54,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336723061] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:55:54,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:55:54,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 10:55:54,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321753450] [2025-01-09 10:55:54,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:55:54,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 10:55:54,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:55:54,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 10:55:54,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 10:55:54,637 INFO L87 Difference]: Start difference. First operand 707 states and 1011 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-01-09 10:55:56,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:55:56,158 INFO L93 Difference]: Finished difference Result 1841 states and 2538 transitions. [2025-01-09 10:55:56,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 10:55:56,159 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 161 [2025-01-09 10:55:56,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:55:56,168 INFO L225 Difference]: With dead ends: 1841 [2025-01-09 10:55:56,168 INFO L226 Difference]: Without dead ends: 1328 [2025-01-09 10:55:56,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2025-01-09 10:55:56,174 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 526 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 10:55:56,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1068 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 10:55:56,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2025-01-09 10:55:56,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 600. [2025-01-09 10:55:56,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 431 states have (on average 1.3062645011600929) internal successors, (563), 431 states have internal predecessors, (563), 144 states have call successors, (144), 24 states have call predecessors, (144), 24 states have return successors, (144), 144 states have call predecessors, (144), 144 states have call successors, (144) [2025-01-09 10:55:56,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 851 transitions. [2025-01-09 10:55:56,249 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 851 transitions. Word has length 161 [2025-01-09 10:55:56,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:55:56,249 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 851 transitions. [2025-01-09 10:55:56,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-01-09 10:55:56,250 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 851 transitions. [2025-01-09 10:55:56,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 10:55:56,250 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:55:56,251 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:56,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:55:56,251 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:55:56,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:55:56,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1561967923, now seen corresponding path program 1 times [2025-01-09 10:55:56,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:55:56,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678819602] [2025-01-09 10:55:56,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:55:56,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:55:56,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 10:55:56,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 10:55:56,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:55:56,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:55:57,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 10:55:57,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:55:57,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678819602] [2025-01-09 10:55:57,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678819602] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:55:57,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:55:57,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 10:55:57,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135288795] [2025-01-09 10:55:57,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:55:57,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 10:55:57,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:55:57,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 10:55:57,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:55:57,897 INFO L87 Difference]: Start difference. First operand 600 states and 851 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 10:55:59,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:55:59,751 INFO L93 Difference]: Finished difference Result 1407 states and 1966 transitions. [2025-01-09 10:55:59,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 10:55:59,752 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2025-01-09 10:55:59,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:55:59,759 INFO L225 Difference]: With dead ends: 1407 [2025-01-09 10:55:59,763 INFO L226 Difference]: Without dead ends: 972 [2025-01-09 10:55:59,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2025-01-09 10:55:59,765 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 385 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 10:55:59,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 685 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 10:55:59,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2025-01-09 10:55:59,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 623. [2025-01-09 10:55:59,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 454 states have (on average 1.3105726872246697) internal successors, (595), 454 states have internal predecessors, (595), 144 states have call successors, (144), 24 states have call predecessors, (144), 24 states have return successors, (144), 144 states have call predecessors, (144), 144 states have call successors, (144) [2025-01-09 10:55:59,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 883 transitions. [2025-01-09 10:55:59,914 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 883 transitions. Word has length 161 [2025-01-09 10:55:59,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:55:59,917 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 883 transitions. [2025-01-09 10:55:59,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 10:55:59,917 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 883 transitions. [2025-01-09 10:55:59,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 10:55:59,918 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:55:59,918 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:59,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 10:55:59,919 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:55:59,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:55:59,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1303802485, now seen corresponding path program 1 times [2025-01-09 10:55:59,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:55:59,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189961313] [2025-01-09 10:55:59,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:55:59,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:55:59,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 10:55:59,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 10:55:59,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:55:59,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:56:02,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 10:56:02,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:56:02,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189961313] [2025-01-09 10:56:02,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189961313] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:56:02,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:56:02,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 10:56:02,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18084904] [2025-01-09 10:56:02,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:56:02,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 10:56:02,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:56:02,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 10:56:02,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:56:02,530 INFO L87 Difference]: Start difference. First operand 623 states and 883 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 10:56:04,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:56:04,374 INFO L93 Difference]: Finished difference Result 1424 states and 2000 transitions. [2025-01-09 10:56:04,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 10:56:04,374 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2025-01-09 10:56:04,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:56:04,378 INFO L225 Difference]: With dead ends: 1424 [2025-01-09 10:56:04,378 INFO L226 Difference]: Without dead ends: 966 [2025-01-09 10:56:04,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2025-01-09 10:56:04,379 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 435 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:56:04,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 789 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 10:56:04,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2025-01-09 10:56:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 634. [2025-01-09 10:56:04,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 465 states have (on average 1.313978494623656) internal successors, (611), 465 states have internal predecessors, (611), 144 states have call successors, (144), 24 states have call predecessors, (144), 24 states have return successors, (144), 144 states have call predecessors, (144), 144 states have call successors, (144) [2025-01-09 10:56:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 899 transitions. [2025-01-09 10:56:04,452 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 899 transitions. Word has length 161 [2025-01-09 10:56:04,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:56:04,452 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 899 transitions. [2025-01-09 10:56:04,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 10:56:04,453 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 899 transitions. [2025-01-09 10:56:04,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 10:56:04,453 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:56:04,454 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:04,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 10:56:04,454 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:56:04,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:56:04,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1795101361, now seen corresponding path program 1 times [2025-01-09 10:56:04,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:56:04,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334694282] [2025-01-09 10:56:04,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:56:04,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:56:04,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 10:56:04,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 10:56:04,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:56:04,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:56:06,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 10:56:06,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:56:06,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334694282] [2025-01-09 10:56:06,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334694282] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:56:06,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:56:06,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 10:56:06,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18730719] [2025-01-09 10:56:06,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:56:06,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 10:56:06,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:56:06,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 10:56:06,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:56:06,938 INFO L87 Difference]: Start difference. First operand 634 states and 899 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:56:08,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:56:08,704 INFO L93 Difference]: Finished difference Result 1313 states and 1832 transitions. [2025-01-09 10:56:08,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 10:56:08,705 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2025-01-09 10:56:08,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:56:08,709 INFO L225 Difference]: With dead ends: 1313 [2025-01-09 10:56:08,709 INFO L226 Difference]: Without dead ends: 1311 [2025-01-09 10:56:08,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2025-01-09 10:56:08,710 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 545 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:56:08,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 888 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 10:56:08,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2025-01-09 10:56:08,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 966. [2025-01-09 10:56:08,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 713 states have (on average 1.3239831697054698) internal successors, (944), 713 states have internal predecessors, (944), 216 states have call successors, (216), 36 states have call predecessors, (216), 36 states have return successors, (216), 216 states have call predecessors, (216), 216 states have call successors, (216) [2025-01-09 10:56:08,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1376 transitions. [2025-01-09 10:56:08,815 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1376 transitions. Word has length 161 [2025-01-09 10:56:08,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:56:08,816 INFO L471 AbstractCegarLoop]: Abstraction has 966 states and 1376 transitions. [2025-01-09 10:56:08,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:56:08,816 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1376 transitions. [2025-01-09 10:56:08,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 10:56:08,817 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:56:08,817 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:08,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 10:56:08,817 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:56:08,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:56:08,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1536935923, now seen corresponding path program 1 times [2025-01-09 10:56:08,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:56:08,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001211836] [2025-01-09 10:56:08,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:56:08,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:56:08,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 10:56:08,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 10:56:08,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:56:08,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:56:11,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 10:56:11,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:56:11,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001211836] [2025-01-09 10:56:11,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001211836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:56:11,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:56:11,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 10:56:11,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958598653] [2025-01-09 10:56:11,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:56:11,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 10:56:11,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:56:11,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 10:56:11,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-01-09 10:56:11,352 INFO L87 Difference]: Start difference. First operand 966 states and 1376 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:56:13,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:56:13,569 INFO L93 Difference]: Finished difference Result 1143 states and 1610 transitions. [2025-01-09 10:56:13,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 10:56:13,569 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2025-01-09 10:56:13,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:56:13,575 INFO L225 Difference]: With dead ends: 1143 [2025-01-09 10:56:13,575 INFO L226 Difference]: Without dead ends: 1141 [2025-01-09 10:56:13,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-01-09 10:56:13,575 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 526 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:56:13,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 702 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 10:56:13,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2025-01-09 10:56:13,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 966. [2025-01-09 10:56:13,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 713 states have (on average 1.3239831697054698) internal successors, (944), 713 states have internal predecessors, (944), 216 states have call successors, (216), 36 states have call predecessors, (216), 36 states have return successors, (216), 216 states have call predecessors, (216), 216 states have call successors, (216) [2025-01-09 10:56:13,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1376 transitions. [2025-01-09 10:56:13,719 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1376 transitions. Word has length 161 [2025-01-09 10:56:13,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:56:13,719 INFO L471 AbstractCegarLoop]: Abstraction has 966 states and 1376 transitions. [2025-01-09 10:56:13,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:56:13,719 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1376 transitions. [2025-01-09 10:56:13,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 10:56:13,720 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:56:13,720 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:13,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 10:56:13,720 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:56:13,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:56:13,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1362545336, now seen corresponding path program 1 times [2025-01-09 10:56:13,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:56:13,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946625159] [2025-01-09 10:56:13,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:56:13,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:56:13,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 10:56:13,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 10:56:13,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:56:13,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:56:16,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 10:56:16,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:56:16,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946625159] [2025-01-09 10:56:16,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946625159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:56:16,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:56:16,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 10:56:16,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041740912] [2025-01-09 10:56:16,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:56:16,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 10:56:16,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:56:16,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 10:56:16,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-01-09 10:56:16,787 INFO L87 Difference]: Start difference. First operand 966 states and 1376 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:56:17,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:56:17,986 INFO L93 Difference]: Finished difference Result 1428 states and 1990 transitions. [2025-01-09 10:56:17,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 10:56:17,987 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2025-01-09 10:56:17,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:56:17,991 INFO L225 Difference]: With dead ends: 1428 [2025-01-09 10:56:17,991 INFO L226 Difference]: Without dead ends: 1426 [2025-01-09 10:56:17,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-01-09 10:56:17,992 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 428 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 10:56:17,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 641 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 10:56:17,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2025-01-09 10:56:18,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 977. [2025-01-09 10:56:18,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 724 states have (on average 1.3273480662983426) internal successors, (961), 724 states have internal predecessors, (961), 216 states have call successors, (216), 36 states have call predecessors, (216), 36 states have return successors, (216), 216 states have call predecessors, (216), 216 states have call successors, (216) [2025-01-09 10:56:18,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1393 transitions. [2025-01-09 10:56:18,097 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1393 transitions. Word has length 161 [2025-01-09 10:56:18,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:56:18,098 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1393 transitions. [2025-01-09 10:56:18,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:56:18,098 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1393 transitions. [2025-01-09 10:56:18,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 10:56:18,099 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:56:18,099 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:18,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 10:56:18,099 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:56:18,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:56:18,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1949351350, now seen corresponding path program 1 times [2025-01-09 10:56:18,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:56:18,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549745818] [2025-01-09 10:56:18,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:56:18,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:56:18,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 10:56:18,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 10:56:18,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:56:18,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:56:21,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 10:56:21,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:56:21,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549745818] [2025-01-09 10:56:21,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549745818] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:56:21,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:56:21,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 10:56:21,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195254567] [2025-01-09 10:56:21,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:56:21,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 10:56:21,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:56:21,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 10:56:21,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:56:21,640 INFO L87 Difference]: Start difference. First operand 977 states and 1393 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:56:23,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:56:23,466 INFO L93 Difference]: Finished difference Result 1421 states and 1983 transitions. [2025-01-09 10:56:23,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 10:56:23,467 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2025-01-09 10:56:23,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:56:23,471 INFO L225 Difference]: With dead ends: 1421 [2025-01-09 10:56:23,471 INFO L226 Difference]: Without dead ends: 1419 [2025-01-09 10:56:23,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-01-09 10:56:23,472 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 441 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:56:23,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 609 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 10:56:23,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2025-01-09 10:56:23,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 971. [2025-01-09 10:56:23,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 718 states have (on average 1.3259052924791086) internal successors, (952), 718 states have internal predecessors, (952), 216 states have call successors, (216), 36 states have call predecessors, (216), 36 states have return successors, (216), 216 states have call predecessors, (216), 216 states have call successors, (216) [2025-01-09 10:56:23,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1384 transitions. [2025-01-09 10:56:23,579 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1384 transitions. Word has length 161 [2025-01-09 10:56:23,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:56:23,581 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1384 transitions. [2025-01-09 10:56:23,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:56:23,581 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1384 transitions. [2025-01-09 10:56:23,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 10:56:23,582 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:56:23,582 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:23,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 10:56:23,582 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:56:23,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:56:23,582 INFO L85 PathProgramCache]: Analyzing trace with hash 911518033, now seen corresponding path program 1 times [2025-01-09 10:56:23,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:56:23,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138844765] [2025-01-09 10:56:23,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:56:23,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:56:23,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 10:56:23,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 10:56:23,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:56:23,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat