./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-34.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-ci_file-34.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 c28c916d59e15fbb84eacdc574b21cac712312e1644083eaa396f6071a295218 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:25:47,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:25:47,884 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:25:47,891 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:25:47,891 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:25:47,916 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:25:47,916 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:25:47,917 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:25:47,917 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:25:47,917 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:25:47,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:25:47,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:25:47,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:25:47,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:25:47,918 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:25:47,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:25:47,919 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:25:47,919 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:25:47,919 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:25:47,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:25:47,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:25:47,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:25:47,919 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:25:47,919 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:25:47,919 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:25:47,919 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:25:47,919 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:25:47,920 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:25:47,920 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:25:47,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:25:47,920 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:25:47,920 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:25:47,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:25:47,920 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:25:47,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:25:47,921 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:25:47,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:25:47,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:25:47,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:25:47,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:25:47,921 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:25:47,921 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:25:47,921 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:25:47,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:25:47,921 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:25:47,921 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:25:47,921 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:25:47,922 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:25:47,922 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 -> c28c916d59e15fbb84eacdc574b21cac712312e1644083eaa396f6071a295218 [2025-01-09 10:25:48,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:25:48,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:25:48,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:25:48,157 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:25:48,157 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:25:48,158 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-ci_file-34.i [2025-01-09 10:25:49,234 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9d47505a2/de59b00ca17a4ece815598055924892c/FLAG61a573ae1 [2025-01-09 10:25:49,481 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:25:49,481 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-34.i [2025-01-09 10:25:49,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9d47505a2/de59b00ca17a4ece815598055924892c/FLAG61a573ae1 [2025-01-09 10:25:49,800 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9d47505a2/de59b00ca17a4ece815598055924892c [2025-01-09 10:25:49,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:25:49,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:25:49,803 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:25:49,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:25:49,806 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:25:49,807 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:25:49" (1/1) ... [2025-01-09 10:25:49,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d0174ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:25:49, skipping insertion in model container [2025-01-09 10:25:49,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:25:49" (1/1) ... [2025-01-09 10:25:49,825 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:25:49,923 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-ci_file-34.i[919,932] [2025-01-09 10:25:49,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:25:50,014 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:25:50,024 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-ci_file-34.i[919,932] [2025-01-09 10:25:50,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:25:50,077 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:25:50,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:25:50 WrapperNode [2025-01-09 10:25:50,079 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:25:50,080 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:25:50,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:25:50,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:25:50,086 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:25:50" (1/1) ... [2025-01-09 10:25:50,098 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:25:50" (1/1) ... [2025-01-09 10:25:50,124 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2025-01-09 10:25:50,124 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:25:50,125 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:25:50,125 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:25:50,125 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:25:50,131 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:25:50" (1/1) ... [2025-01-09 10:25:50,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:25:50" (1/1) ... [2025-01-09 10:25:50,133 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:25:50" (1/1) ... [2025-01-09 10:25:50,148 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:25:50,148 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:25:50" (1/1) ... [2025-01-09 10:25:50,149 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:25:50" (1/1) ... [2025-01-09 10:25:50,155 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:25:50" (1/1) ... [2025-01-09 10:25:50,160 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:25:50" (1/1) ... [2025-01-09 10:25:50,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:25:50" (1/1) ... [2025-01-09 10:25:50,169 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:25:50" (1/1) ... [2025-01-09 10:25:50,170 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:25:50" (1/1) ... [2025-01-09 10:25:50,176 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:25:50,176 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:25:50,177 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:25:50,177 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:25:50,177 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:25:50" (1/1) ... [2025-01-09 10:25:50,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:25:50,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:25:50,200 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:25:50,205 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:25:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:25:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:25:50,216 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:25:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:25:50,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:25:50,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:25:50,277 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:25:50,279 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:25:50,678 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-01-09 10:25:50,678 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:25:50,689 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:25:50,689 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:25:50,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:25:50 BoogieIcfgContainer [2025-01-09 10:25:50,690 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:25:50,691 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:25:50,692 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:25:50,696 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:25:50,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:25:49" (1/3) ... [2025-01-09 10:25:50,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41490ad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:25:50, skipping insertion in model container [2025-01-09 10:25:50,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:25:50" (2/3) ... [2025-01-09 10:25:50,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41490ad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:25:50, skipping insertion in model container [2025-01-09 10:25:50,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:25:50" (3/3) ... [2025-01-09 10:25:50,698 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-34.i [2025-01-09 10:25:50,708 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:25:50,709 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-34.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:25:50,743 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:25:50,754 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;@372f263e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:25:50,754 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:25:50,757 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 70 states have internal predecessors, (104), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 10:25:50,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 10:25:50,766 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:25:50,767 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:25:50,767 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:25:50,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:25:50,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1244021012, now seen corresponding path program 1 times [2025-01-09 10:25:50,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:25:50,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822188270] [2025-01-09 10:25:50,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:25:50,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:25:50,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 10:25:50,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 10:25:50,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:25:50,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:25:50,999 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 10:25:50,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:25:51,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822188270] [2025-01-09 10:25:51,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822188270] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:25:51,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755673046] [2025-01-09 10:25:51,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:25:51,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:25:51,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:25:51,002 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:25:51,004 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:25:51,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 10:25:51,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 10:25:51,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:25:51,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:25:51,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:25:51,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:25:51,183 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 10:25:51,183 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:25:51,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755673046] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:25:51,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:25:51,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:25:51,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313609715] [2025-01-09 10:25:51,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:25:51,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:25:51,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:25:51,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:25:51,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:25:51,205 INFO L87 Difference]: Start difference. First operand has 92 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 70 states have internal predecessors, (104), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 10:25:51,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:25:51,230 INFO L93 Difference]: Finished difference Result 178 states and 303 transitions. [2025-01-09 10:25:51,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:25:51,232 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 141 [2025-01-09 10:25:51,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:25:51,237 INFO L225 Difference]: With dead ends: 178 [2025-01-09 10:25:51,238 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 10:25:51,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 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:25:51,244 INFO L435 NwaCegarLoop]: 139 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, 139 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:25:51,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:25:51,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 10:25:51,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-01-09 10:25:51,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 67 states have internal predecessors, (99), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 10:25:51,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 139 transitions. [2025-01-09 10:25:51,280 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 139 transitions. Word has length 141 [2025-01-09 10:25:51,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:25:51,280 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 139 transitions. [2025-01-09 10:25:51,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 10:25:51,282 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 139 transitions. [2025-01-09 10:25:51,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 10:25:51,287 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:25:51,287 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:25:51,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 10:25:51,488 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:25:51,488 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:25:51,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:25:51,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1508623920, now seen corresponding path program 1 times [2025-01-09 10:25:51,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:25:51,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065848061] [2025-01-09 10:25:51,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:25:51,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:25:51,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 10:25:51,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 10:25:51,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:25:51,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:25:51,952 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 10:25:51,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:25:51,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065848061] [2025-01-09 10:25:51,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065848061] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:25:51,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:25:51,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:25:51,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270708481] [2025-01-09 10:25:51,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:25:51,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:25:51,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:25:51,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:25:51,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:25:51,959 INFO L87 Difference]: Start difference. First operand 89 states and 139 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 10:25:52,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:25:52,109 INFO L93 Difference]: Finished difference Result 301 states and 475 transitions. [2025-01-09 10:25:52,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:25:52,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2025-01-09 10:25:52,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:25:52,114 INFO L225 Difference]: With dead ends: 301 [2025-01-09 10:25:52,114 INFO L226 Difference]: Without dead ends: 215 [2025-01-09 10:25:52,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:25:52,115 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 172 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:25:52,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 454 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:25:52,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-01-09 10:25:52,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 175. [2025-01-09 10:25:52,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 132 states have (on average 1.4772727272727273) internal successors, (195), 132 states have internal predecessors, (195), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 10:25:52,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 275 transitions. [2025-01-09 10:25:52,140 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 275 transitions. Word has length 141 [2025-01-09 10:25:52,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:25:52,140 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 275 transitions. [2025-01-09 10:25:52,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 10:25:52,141 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 275 transitions. [2025-01-09 10:25:52,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 10:25:52,143 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:25:52,143 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:25:52,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:25:52,143 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:25:52,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:25:52,144 INFO L85 PathProgramCache]: Analyzing trace with hash -120518635, now seen corresponding path program 1 times [2025-01-09 10:25:52,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:25:52,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294501530] [2025-01-09 10:25:52,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:25:52,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:25:52,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 10:25:52,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 10:25:52,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:25:52,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:25:52,472 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 10:25:52,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:25:52,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294501530] [2025-01-09 10:25:52,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294501530] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:25:52,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:25:52,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:25:52,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379979388] [2025-01-09 10:25:52,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:25:52,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:25:52,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:25:52,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:25:52,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:25:52,476 INFO L87 Difference]: Start difference. First operand 175 states and 275 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 10:25:52,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:25:52,689 INFO L93 Difference]: Finished difference Result 514 states and 808 transitions. [2025-01-09 10:25:52,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:25:52,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2025-01-09 10:25:52,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:25:52,693 INFO L225 Difference]: With dead ends: 514 [2025-01-09 10:25:52,695 INFO L226 Difference]: Without dead ends: 342 [2025-01-09 10:25:52,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:25:52,698 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 222 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:25:52,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 401 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:25:52,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-01-09 10:25:52,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 179. [2025-01-09 10:25:52,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 136 states have (on average 1.463235294117647) internal successors, (199), 136 states have internal predecessors, (199), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 10:25:52,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 279 transitions. [2025-01-09 10:25:52,739 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 279 transitions. Word has length 142 [2025-01-09 10:25:52,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:25:52,739 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 279 transitions. [2025-01-09 10:25:52,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 10:25:52,739 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 279 transitions. [2025-01-09 10:25:52,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 10:25:52,741 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:25:52,741 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:25:52,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:25:52,741 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:25:52,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:25:52,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1402924504, now seen corresponding path program 1 times [2025-01-09 10:25:52,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:25:52,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906241308] [2025-01-09 10:25:52,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:25:52,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:25:52,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 10:25:52,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 10:25:52,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:25:52,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:25:56,769 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 10:25:56,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:25:56,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906241308] [2025-01-09 10:25:56,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906241308] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:25:56,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:25:56,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 10:25:56,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9348844] [2025-01-09 10:25:56,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:25:56,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 10:25:56,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:25:56,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 10:25:56,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:25:56,772 INFO L87 Difference]: Start difference. First operand 179 states and 279 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 10:25:58,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:25:58,594 INFO L93 Difference]: Finished difference Result 647 states and 1005 transitions. [2025-01-09 10:25:58,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 10:25:58,595 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-01-09 10:25:58,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:25:58,598 INFO L225 Difference]: With dead ends: 647 [2025-01-09 10:25:58,598 INFO L226 Difference]: Without dead ends: 471 [2025-01-09 10:25:58,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2025-01-09 10:25:58,600 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 691 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:25:58,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 484 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 10:25:58,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-01-09 10:25:58,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 287. [2025-01-09 10:25:58,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 232 states have (on average 1.4956896551724137) internal successors, (347), 234 states have internal predecessors, (347), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 10:25:58,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 447 transitions. [2025-01-09 10:25:58,630 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 447 transitions. Word has length 143 [2025-01-09 10:25:58,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:25:58,630 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 447 transitions. [2025-01-09 10:25:58,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 10:25:58,631 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 447 transitions. [2025-01-09 10:25:58,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 10:25:58,634 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:25:58,634 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:25:58,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:25:58,635 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:25:58,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:25:58,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1880925542, now seen corresponding path program 1 times [2025-01-09 10:25:58,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:25:58,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511326781] [2025-01-09 10:25:58,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:25:58,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:25:58,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 10:25:58,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 10:25:58,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:25:58,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:26:00,303 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 10:26:00,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:26:00,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511326781] [2025-01-09 10:26:00,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511326781] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:26:00,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:26:00,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 10:26:00,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332180711] [2025-01-09 10:26:00,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:26:00,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 10:26:00,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:26:00,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 10:26:00,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:26:00,306 INFO L87 Difference]: Start difference. First operand 287 states and 447 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 10:26:01,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:26:01,314 INFO L93 Difference]: Finished difference Result 1123 states and 1765 transitions. [2025-01-09 10:26:01,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 10:26:01,314 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-01-09 10:26:01,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:26:01,322 INFO L225 Difference]: With dead ends: 1123 [2025-01-09 10:26:01,322 INFO L226 Difference]: Without dead ends: 839 [2025-01-09 10:26:01,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-01-09 10:26:01,324 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 442 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 10:26:01,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 489 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 10:26:01,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2025-01-09 10:26:01,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 393. [2025-01-09 10:26:01,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 317 states have (on average 1.4479495268138802) internal successors, (459), 319 states have internal predecessors, (459), 70 states have call successors, (70), 5 states have call predecessors, (70), 5 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 10:26:01,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 599 transitions. [2025-01-09 10:26:01,352 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 599 transitions. Word has length 143 [2025-01-09 10:26:01,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:26:01,352 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 599 transitions. [2025-01-09 10:26:01,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 10:26:01,353 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 599 transitions. [2025-01-09 10:26:01,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 10:26:01,354 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:26:01,354 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:26:01,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:26:01,354 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:26:01,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:26:01,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1870974438, now seen corresponding path program 1 times [2025-01-09 10:26:01,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:26:01,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374409118] [2025-01-09 10:26:01,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:26:01,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:26:01,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 10:26:01,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 10:26:01,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:26:01,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:26:02,852 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 10:26:02,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:26:02,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374409118] [2025-01-09 10:26:02,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374409118] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:26:02,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:26:02,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 10:26:02,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137635060] [2025-01-09 10:26:02,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:26:02,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 10:26:02,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:26:02,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 10:26:02,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 10:26:02,855 INFO L87 Difference]: Start difference. First operand 393 states and 599 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 10:26:03,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:26:03,565 INFO L93 Difference]: Finished difference Result 1211 states and 1866 transitions. [2025-01-09 10:26:03,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 10:26:03,565 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-01-09 10:26:03,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:26:03,569 INFO L225 Difference]: With dead ends: 1211 [2025-01-09 10:26:03,569 INFO L226 Difference]: Without dead ends: 866 [2025-01-09 10:26:03,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-01-09 10:26:03,572 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 457 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:26:03,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 462 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:26:03,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2025-01-09 10:26:03,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 678. [2025-01-09 10:26:03,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 602 states have (on average 1.5232558139534884) internal successors, (917), 604 states have internal predecessors, (917), 70 states have call successors, (70), 5 states have call predecessors, (70), 5 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 10:26:03,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1057 transitions. [2025-01-09 10:26:03,600 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1057 transitions. Word has length 143 [2025-01-09 10:26:03,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:26:03,601 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 1057 transitions. [2025-01-09 10:26:03,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 10:26:03,601 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1057 transitions. [2025-01-09 10:26:03,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 10:26:03,602 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:26:03,602 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:26:03,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:26:03,602 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:26:03,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:26:03,603 INFO L85 PathProgramCache]: Analyzing trace with hash 202508887, now seen corresponding path program 1 times [2025-01-09 10:26:03,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:26:03,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957902154] [2025-01-09 10:26:03,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:26:03,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:26:03,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 10:26:03,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 10:26:03,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:26:03,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:26:04,327 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 10:26:04,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:26:04,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957902154] [2025-01-09 10:26:04,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957902154] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:26:04,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:26:04,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:26:04,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515695163] [2025-01-09 10:26:04,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:26:04,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:26:04,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:26:04,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:26:04,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:26:04,329 INFO L87 Difference]: Start difference. First operand 678 states and 1057 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 10:26:04,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:26:04,691 INFO L93 Difference]: Finished difference Result 1318 states and 2061 transitions. [2025-01-09 10:26:04,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 10:26:04,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-01-09 10:26:04,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:26:04,696 INFO L225 Difference]: With dead ends: 1318 [2025-01-09 10:26:04,696 INFO L226 Difference]: Without dead ends: 942 [2025-01-09 10:26:04,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:26:04,698 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 268 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:26:04,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 509 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:26:04,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2025-01-09 10:26:04,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 684. [2025-01-09 10:26:04,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 608 states have (on average 1.5148026315789473) internal successors, (921), 610 states have internal predecessors, (921), 70 states have call successors, (70), 5 states have call predecessors, (70), 5 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 10:26:04,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1061 transitions. [2025-01-09 10:26:04,727 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1061 transitions. Word has length 143 [2025-01-09 10:26:04,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:26:04,729 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 1061 transitions. [2025-01-09 10:26:04,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 10:26:04,730 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1061 transitions. [2025-01-09 10:26:04,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 10:26:04,732 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:26:04,732 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:26:04,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:26:04,732 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:26:04,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:26:04,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1991339928, now seen corresponding path program 1 times [2025-01-09 10:26:04,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:26:04,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134256279] [2025-01-09 10:26:04,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:26:04,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:26:04,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 10:26:04,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 10:26:04,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:26:04,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:26:04,932 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 10:26:04,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:26:04,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134256279] [2025-01-09 10:26:04,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134256279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:26:04,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:26:04,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:26:04,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827364349] [2025-01-09 10:26:04,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:26:04,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:26:04,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:26:04,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:26:04,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:26:04,934 INFO L87 Difference]: Start difference. First operand 684 states and 1061 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 10:26:05,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:26:05,094 INFO L93 Difference]: Finished difference Result 1172 states and 1834 transitions. [2025-01-09 10:26:05,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:26:05,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-01-09 10:26:05,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:26:05,098 INFO L225 Difference]: With dead ends: 1172 [2025-01-09 10:26:05,098 INFO L226 Difference]: Without dead ends: 664 [2025-01-09 10:26:05,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:26:05,099 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 105 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:26:05,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 340 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:26:05,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-01-09 10:26:05,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 610. [2025-01-09 10:26:05,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 534 states have (on average 1.4887640449438202) internal successors, (795), 536 states have internal predecessors, (795), 70 states have call successors, (70), 5 states have call predecessors, (70), 5 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 10:26:05,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 935 transitions. [2025-01-09 10:26:05,126 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 935 transitions. Word has length 143 [2025-01-09 10:26:05,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:26:05,127 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 935 transitions. [2025-01-09 10:26:05,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 10:26:05,127 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 935 transitions. [2025-01-09 10:26:05,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 10:26:05,128 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:26:05,128 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:26:05,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:26:05,128 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:26:05,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:26:05,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1544958016, now seen corresponding path program 1 times [2025-01-09 10:26:05,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:26:05,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365860299] [2025-01-09 10:26:05,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:26:05,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:26:05,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 10:26:05,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 10:26:05,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:26:05,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:26:07,301 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 10:26:07,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:26:07,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365860299] [2025-01-09 10:26:07,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365860299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:26:07,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:26:07,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 10:26:07,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392138917] [2025-01-09 10:26:07,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:26:07,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 10:26:07,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:26:07,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 10:26:07,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:26:07,302 INFO L87 Difference]: Start difference. First operand 610 states and 935 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 10:26:08,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:26:08,385 INFO L93 Difference]: Finished difference Result 1308 states and 2041 transitions. [2025-01-09 10:26:08,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 10:26:08,385 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-01-09 10:26:08,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:26:08,389 INFO L225 Difference]: With dead ends: 1308 [2025-01-09 10:26:08,389 INFO L226 Difference]: Without dead ends: 974 [2025-01-09 10:26:08,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-01-09 10:26:08,391 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 617 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:26:08,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 433 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 10:26:08,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-01-09 10:26:08,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 494. [2025-01-09 10:26:08,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 428 states have (on average 1.4602803738317758) internal successors, (625), 428 states have internal predecessors, (625), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 10:26:08,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 745 transitions. [2025-01-09 10:26:08,419 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 745 transitions. Word has length 144 [2025-01-09 10:26:08,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:26:08,419 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 745 transitions. [2025-01-09 10:26:08,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 10:26:08,419 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 745 transitions. [2025-01-09 10:26:08,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 10:26:08,421 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:26:08,421 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:26:08,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:26:08,421 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:26:08,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:26:08,422 INFO L85 PathProgramCache]: Analyzing trace with hash -105742582, now seen corresponding path program 1 times [2025-01-09 10:26:08,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:26:08,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699765207] [2025-01-09 10:26:08,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:26:08,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:26:08,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 10:26:08,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 10:26:08,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:26:08,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:26:16,083 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 10:26:16,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:26:16,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699765207] [2025-01-09 10:26:16,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699765207] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:26:16,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:26:16,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 10:26:16,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969911983] [2025-01-09 10:26:16,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:26:16,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 10:26:16,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:26:16,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 10:26:16,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 10:26:16,085 INFO L87 Difference]: Start difference. First operand 494 states and 745 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 10:26:17,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:26:17,687 INFO L93 Difference]: Finished difference Result 1138 states and 1715 transitions. [2025-01-09 10:26:17,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 10:26:17,687 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-01-09 10:26:17,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:26:17,690 INFO L225 Difference]: With dead ends: 1138 [2025-01-09 10:26:17,690 INFO L226 Difference]: Without dead ends: 745 [2025-01-09 10:26:17,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2025-01-09 10:26:17,692 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 365 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 10:26:17,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 852 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 10:26:17,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2025-01-09 10:26:17,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 591. [2025-01-09 10:26:17,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 525 states have (on average 1.4780952380952381) internal successors, (776), 525 states have internal predecessors, (776), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 10:26:17,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 896 transitions. [2025-01-09 10:26:17,721 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 896 transitions. Word has length 144 [2025-01-09 10:26:17,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:26:17,722 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 896 transitions. [2025-01-09 10:26:17,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 10:26:17,722 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 896 transitions. [2025-01-09 10:26:17,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 10:26:17,723 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:26:17,723 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:26:17,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:26:17,724 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:26:17,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:26:17,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1312755875, now seen corresponding path program 1 times [2025-01-09 10:26:17,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:26:17,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227357370] [2025-01-09 10:26:17,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:26:17,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:26:17,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 10:26:17,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 10:26:17,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:26:17,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:26:19,917 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 10:26:19,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:26:19,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227357370] [2025-01-09 10:26:19,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227357370] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:26:19,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:26:19,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 10:26:19,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145614259] [2025-01-09 10:26:19,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:26:19,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 10:26:19,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:26:19,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 10:26:19,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:26:19,919 INFO L87 Difference]: Start difference. First operand 591 states and 896 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 10:26:21,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:26:21,173 INFO L93 Difference]: Finished difference Result 1251 states and 1920 transitions. [2025-01-09 10:26:21,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 10:26:21,174 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2025-01-09 10:26:21,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:26:21,178 INFO L225 Difference]: With dead ends: 1251 [2025-01-09 10:26:21,178 INFO L226 Difference]: Without dead ends: 1037 [2025-01-09 10:26:21,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2025-01-09 10:26:21,179 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 415 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 10:26:21,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 643 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 10:26:21,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2025-01-09 10:26:21,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 559. [2025-01-09 10:26:21,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 493 states have (on average 1.4726166328600405) internal successors, (726), 493 states have internal predecessors, (726), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 10:26:21,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 846 transitions. [2025-01-09 10:26:21,204 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 846 transitions. Word has length 145 [2025-01-09 10:26:21,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:26:21,205 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 846 transitions. [2025-01-09 10:26:21,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 10:26:21,205 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 846 transitions. [2025-01-09 10:26:21,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 10:26:21,206 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:26:21,206 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:26:21,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:26:21,207 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:26:21,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:26:21,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1640365097, now seen corresponding path program 1 times [2025-01-09 10:26:21,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:26:21,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477183938] [2025-01-09 10:26:21,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:26:21,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:26:21,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 10:26:21,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 10:26:21,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:26:21,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:26:23,751 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 10:26:23,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:26:23,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477183938] [2025-01-09 10:26:23,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477183938] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:26:23,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:26:23,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 10:26:23,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208031500] [2025-01-09 10:26:23,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:26:23,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 10:26:23,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:26:23,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 10:26:23,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-01-09 10:26:23,753 INFO L87 Difference]: Start difference. First operand 559 states and 846 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 10:26:25,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:26:25,351 INFO L93 Difference]: Finished difference Result 1122 states and 1707 transitions. [2025-01-09 10:26:25,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 10:26:25,351 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2025-01-09 10:26:25,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:26:25,354 INFO L225 Difference]: With dead ends: 1122 [2025-01-09 10:26:25,354 INFO L226 Difference]: Without dead ends: 910 [2025-01-09 10:26:25,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=135, Invalid=245, Unknown=0, NotChecked=0, Total=380 [2025-01-09 10:26:25,355 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 361 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 10:26:25,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 543 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 10:26:25,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2025-01-09 10:26:25,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 565. [2025-01-09 10:26:25,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 499 states have (on average 1.4749498997995991) internal successors, (736), 499 states have internal predecessors, (736), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 10:26:25,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 856 transitions. [2025-01-09 10:26:25,379 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 856 transitions. Word has length 145 [2025-01-09 10:26:25,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:26:25,379 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 856 transitions. [2025-01-09 10:26:25,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 10:26:25,379 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 856 transitions. [2025-01-09 10:26:25,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 10:26:25,380 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:26:25,380 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:26:25,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:26:25,381 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:26:25,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:26:25,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1630413993, now seen corresponding path program 1 times [2025-01-09 10:26:25,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:26:25,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508717210] [2025-01-09 10:26:25,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:26:25,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:26:25,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 10:26:25,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 10:26:25,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:26:25,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:26:30,095 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 10:26:30,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:26:30,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508717210] [2025-01-09 10:26:30,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508717210] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:26:30,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:26:30,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 10:26:30,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789761117] [2025-01-09 10:26:30,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:26:30,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 10:26:30,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:26:30,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 10:26:30,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:26:30,097 INFO L87 Difference]: Start difference. First operand 565 states and 856 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 10:26:32,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:26:32,305 INFO L93 Difference]: Finished difference Result 1198 states and 1832 transitions. [2025-01-09 10:26:32,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 10:26:32,305 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2025-01-09 10:26:32,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:26:32,308 INFO L225 Difference]: With dead ends: 1198 [2025-01-09 10:26:32,308 INFO L226 Difference]: Without dead ends: 817 [2025-01-09 10:26:32,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2025-01-09 10:26:32,309 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 502 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 10:26:32,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 644 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 10:26:32,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2025-01-09 10:26:32,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 593. [2025-01-09 10:26:32,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 527 states have (on average 1.4781783681214422) internal successors, (779), 527 states have internal predecessors, (779), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 10:26:32,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 899 transitions. [2025-01-09 10:26:32,334 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 899 transitions. Word has length 145 [2025-01-09 10:26:32,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:26:32,335 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 899 transitions. [2025-01-09 10:26:32,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 10:26:32,335 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 899 transitions. [2025-01-09 10:26:32,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 10:26:32,336 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:26:32,336 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:26:32,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 10:26:32,337 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:26:32,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:26:32,337 INFO L85 PathProgramCache]: Analyzing trace with hash 619296743, now seen corresponding path program 1 times [2025-01-09 10:26:32,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:26:32,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783573609] [2025-01-09 10:26:32,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:26:32,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:26:32,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 10:26:32,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 10:26:32,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:26:32,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:26:37,400 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 10:26:37,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:26:37,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783573609] [2025-01-09 10:26:37,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783573609] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:26:37,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:26:37,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 10:26:37,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897930065] [2025-01-09 10:26:37,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:26:37,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 10:26:37,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:26:37,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 10:26:37,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-01-09 10:26:37,402 INFO L87 Difference]: Start difference. First operand 593 states and 899 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 10:26:41,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:26:41,447 INFO L93 Difference]: Finished difference Result 1061 states and 1579 transitions. [2025-01-09 10:26:41,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 10:26:41,448 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 145 [2025-01-09 10:26:41,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:26:41,451 INFO L225 Difference]: With dead ends: 1061 [2025-01-09 10:26:41,451 INFO L226 Difference]: Without dead ends: 803 [2025-01-09 10:26:41,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=216, Invalid=654, Unknown=0, NotChecked=0, Total=870 [2025-01-09 10:26:41,454 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 403 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:26:41,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 815 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 10:26:41,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-01-09 10:26:41,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 663. [2025-01-09 10:26:41,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 597 states have (on average 1.4824120603015076) internal successors, (885), 597 states have internal predecessors, (885), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 10:26:41,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1005 transitions. [2025-01-09 10:26:41,487 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1005 transitions. Word has length 145 [2025-01-09 10:26:41,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:26:41,487 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 1005 transitions. [2025-01-09 10:26:41,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 10:26:41,487 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1005 transitions. [2025-01-09 10:26:41,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 10:26:41,489 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:26:41,489 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:26:41,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 10:26:41,490 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:26:41,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:26:41,490 INFO L85 PathProgramCache]: Analyzing trace with hash 787245791, now seen corresponding path program 1 times [2025-01-09 10:26:41,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:26:41,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395743545] [2025-01-09 10:26:41,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:26:41,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:26:41,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 10:26:41,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 10:26:41,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:26:41,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:26:55,786 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 10:26:55,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:26:55,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395743545] [2025-01-09 10:26:55,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395743545] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:26:55,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:26:55,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 10:26:55,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286666360] [2025-01-09 10:26:55,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:26:55,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 10:26:55,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:26:55,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 10:26:55,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-09 10:26:55,789 INFO L87 Difference]: Start difference. First operand 663 states and 1005 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 10:26:56,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:26:56,915 INFO L93 Difference]: Finished difference Result 1136 states and 1694 transitions. [2025-01-09 10:26:56,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 10:26:56,916 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 146 [2025-01-09 10:26:56,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:26:56,920 INFO L225 Difference]: With dead ends: 1136 [2025-01-09 10:26:56,920 INFO L226 Difference]: Without dead ends: 1134 [2025-01-09 10:26:56,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2025-01-09 10:26:56,922 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 623 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:26:56,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 838 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 10:26:56,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2025-01-09 10:26:56,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 763. [2025-01-09 10:26:56,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 697 states have (on average 1.4748923959827833) internal successors, (1028), 697 states have internal predecessors, (1028), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 10:26:56,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1148 transitions. [2025-01-09 10:26:56,959 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1148 transitions. Word has length 146 [2025-01-09 10:26:56,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:26:56,960 INFO L471 AbstractCegarLoop]: Abstraction has 763 states and 1148 transitions. [2025-01-09 10:26:56,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 10:26:56,960 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1148 transitions. [2025-01-09 10:26:56,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 10:26:56,962 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:26:56,962 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:26:56,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 10:26:56,962 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:26:56,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:26:56,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1584493471, now seen corresponding path program 1 times [2025-01-09 10:26:56,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:26:56,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591552338] [2025-01-09 10:26:56,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:26:56,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:26:56,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 10:26:56,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 10:26:56,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:26:56,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:27:09,942 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 10:27:09,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:27:09,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591552338] [2025-01-09 10:27:09,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591552338] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:27:09,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:27:09,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 10:27:09,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885976572] [2025-01-09 10:27:09,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:27:09,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 10:27:09,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:27:09,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 10:27:09,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-09 10:27:09,944 INFO L87 Difference]: Start difference. First operand 763 states and 1148 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 10:27:10,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:27:10,991 INFO L93 Difference]: Finished difference Result 1166 states and 1733 transitions. [2025-01-09 10:27:10,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 10:27:10,991 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 146 [2025-01-09 10:27:10,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:27:10,995 INFO L225 Difference]: With dead ends: 1166 [2025-01-09 10:27:10,995 INFO L226 Difference]: Without dead ends: 1164 [2025-01-09 10:27:10,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-01-09 10:27:10,995 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 443 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:27:10,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 860 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 10:27:10,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2025-01-09 10:27:11,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 860. [2025-01-09 10:27:11,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 794 states have (on average 1.4634760705289673) internal successors, (1162), 794 states have internal predecessors, (1162), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 10:27:11,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1282 transitions. [2025-01-09 10:27:11,031 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1282 transitions. Word has length 146 [2025-01-09 10:27:11,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:27:11,031 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 1282 transitions. [2025-01-09 10:27:11,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 10:27:11,031 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1282 transitions. [2025-01-09 10:27:11,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 10:27:11,032 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:27:11,033 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:27:11,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 10:27:11,033 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:27:11,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:27:11,033 INFO L85 PathProgramCache]: Analyzing trace with hash 277772701, now seen corresponding path program 1 times [2025-01-09 10:27:11,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:27:11,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049199247] [2025-01-09 10:27:11,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:27:11,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:27:11,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 10:27:11,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 10:27:11,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:27:11,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:27:11,127 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 10:27:11,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:27:11,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049199247] [2025-01-09 10:27:11,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049199247] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:27:11,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:27:11,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:27:11,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60552203] [2025-01-09 10:27:11,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:27:11,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:27:11,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:27:11,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:27:11,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:27:11,130 INFO L87 Difference]: Start difference. First operand 860 states and 1282 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 10:27:11,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:27:11,248 INFO L93 Difference]: Finished difference Result 1492 states and 2238 transitions. [2025-01-09 10:27:11,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:27:11,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2025-01-09 10:27:11,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:27:11,252 INFO L225 Difference]: With dead ends: 1492 [2025-01-09 10:27:11,252 INFO L226 Difference]: Without dead ends: 887 [2025-01-09 10:27:11,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:27:11,253 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 115 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:27:11,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 518 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:27:11,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2025-01-09 10:27:11,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 863. [2025-01-09 10:27:11,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 797 states have (on average 1.4617314930991216) internal successors, (1165), 797 states have internal predecessors, (1165), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 10:27:11,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1285 transitions. [2025-01-09 10:27:11,290 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1285 transitions. Word has length 146 [2025-01-09 10:27:11,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:27:11,290 INFO L471 AbstractCegarLoop]: Abstraction has 863 states and 1285 transitions. [2025-01-09 10:27:11,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 10:27:11,290 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1285 transitions. [2025-01-09 10:27:11,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 10:27:11,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:27:11,292 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:27:11,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 10:27:11,293 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:27:11,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:27:11,293 INFO L85 PathProgramCache]: Analyzing trace with hash 711631679, now seen corresponding path program 1 times [2025-01-09 10:27:11,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:27:11,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529364653] [2025-01-09 10:27:11,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:27:11,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:27:11,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 10:27:11,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 10:27:11,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:27:11,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat