./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_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-pr-cn_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 a2e67766c6fd196971faf344e8fff85e5c895ea0afd7f2774008fd81029a9807 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:15:18,127 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:15:18,171 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 11:15:18,174 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:15:18,175 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:15:18,194 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:15:18,194 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:15:18,195 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:15:18,195 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:15:18,195 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:15:18,195 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:15:18,195 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:15:18,195 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:15:18,195 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:15:18,195 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:15:18,196 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:15:18,196 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:15:18,196 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:15:18,196 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:15:18,196 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:15:18,196 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:15:18,196 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:15:18,196 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:15:18,196 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:15:18,196 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:15:18,196 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:15:18,196 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:15:18,196 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:15:18,196 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:15:18,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:15:18,196 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:15:18,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:15:18,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:15:18,196 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:15:18,197 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:15:18,197 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:15:18,197 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:15:18,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:15:18,197 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:15:18,197 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:15:18,197 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:15:18,197 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:15:18,197 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:15:18,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:15:18,197 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:15:18,197 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:15:18,197 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:15:18,197 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:15:18,197 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 -> a2e67766c6fd196971faf344e8fff85e5c895ea0afd7f2774008fd81029a9807 [2025-01-09 11:15:18,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:15:18,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:15:18,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:15:18,446 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:15:18,446 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:15:18,447 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-pr-cn_file-34.i [2025-01-09 11:15:19,642 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32acff93a/ee1ab4eec981434f9f3d8db7e55c9d42/FLAG2a3f5b61e [2025-01-09 11:15:19,903 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:15:19,903 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-34.i [2025-01-09 11:15:19,915 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32acff93a/ee1ab4eec981434f9f3d8db7e55c9d42/FLAG2a3f5b61e [2025-01-09 11:15:19,934 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32acff93a/ee1ab4eec981434f9f3d8db7e55c9d42 [2025-01-09 11:15:19,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:15:19,943 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:15:19,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:15:19,944 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:15:19,947 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:15:19,949 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:15:19" (1/1) ... [2025-01-09 11:15:19,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53fef799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:15:19, skipping insertion in model container [2025-01-09 11:15:19,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:15:19" (1/1) ... [2025-01-09 11:15:19,968 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:15:20,085 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-pr-cn_file-34.i[919,932] [2025-01-09 11:15:20,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:15:20,149 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:15:20,157 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-pr-cn_file-34.i[919,932] [2025-01-09 11:15:20,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:15:20,199 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:15:20,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:15:20 WrapperNode [2025-01-09 11:15:20,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:15:20,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:15:20,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:15:20,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:15:20,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:15:20" (1/1) ... [2025-01-09 11:15:20,216 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:15:20" (1/1) ... [2025-01-09 11:15:20,256 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 263 [2025-01-09 11:15:20,257 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:15:20,257 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:15:20,257 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:15:20,257 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:15:20,264 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:15:20" (1/1) ... [2025-01-09 11:15:20,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:15:20" (1/1) ... [2025-01-09 11:15:20,272 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:15:20" (1/1) ... [2025-01-09 11:15:20,288 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 11:15:20,292 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:15:20" (1/1) ... [2025-01-09 11:15:20,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:15:20" (1/1) ... [2025-01-09 11:15:20,302 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:15:20" (1/1) ... [2025-01-09 11:15:20,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:15:20" (1/1) ... [2025-01-09 11:15:20,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:15:20" (1/1) ... [2025-01-09 11:15:20,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:15:20" (1/1) ... [2025-01-09 11:15:20,311 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:15:20" (1/1) ... [2025-01-09 11:15:20,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:15:20,314 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:15:20,314 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:15:20,314 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:15:20,315 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:15:20" (1/1) ... [2025-01-09 11:15:20,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:15:20,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:15:20,341 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 11:15:20,346 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 11:15:20,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:15:20,361 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:15:20,361 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:15:20,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:15:20,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:15:20,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:15:20,434 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:15:20,435 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:15:20,791 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-01-09 11:15:20,791 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:15:20,799 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:15:20,799 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:15:20,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:15:20 BoogieIcfgContainer [2025-01-09 11:15:20,799 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:15:20,801 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:15:20,801 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:15:20,804 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:15:20,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:15:19" (1/3) ... [2025-01-09 11:15:20,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d411ca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:15:20, skipping insertion in model container [2025-01-09 11:15:20,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:15:20" (2/3) ... [2025-01-09 11:15:20,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d411ca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:15:20, skipping insertion in model container [2025-01-09 11:15:20,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:15:20" (3/3) ... [2025-01-09 11:15:20,805 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-34.i [2025-01-09 11:15:20,814 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:15:20,815 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-34.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:15:20,847 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:15:20,854 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;@4adaeaa0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:15:20,854 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:15:20,857 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 76 states have internal predecessors, (110), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 11:15:20,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 11:15:20,867 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:15:20,867 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:15:20,867 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:15:20,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:15:20,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1689979582, now seen corresponding path program 1 times [2025-01-09 11:15:20,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:15:20,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156844330] [2025-01-09 11:15:20,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:15:20,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:15:20,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 11:15:20,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 11:15:20,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:15:20,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:15:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-01-09 11:15:21,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:15:21,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156844330] [2025-01-09 11:15:21,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156844330] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:15:21,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948934060] [2025-01-09 11:15:21,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:15:21,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:15:21,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:15:21,169 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 11:15:21,173 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 11:15:21,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 11:15:21,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 11:15:21,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:15:21,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:15:21,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:15:21,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:15:21,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-01-09 11:15:21,346 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:15:21,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948934060] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:15:21,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:15:21,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 11:15:21,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390708387] [2025-01-09 11:15:21,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:15:21,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:15:21,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:15:21,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:15:21,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:15:21,376 INFO L87 Difference]: Start difference. First operand has 111 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 76 states have internal predecessors, (110), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 11:15:21,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:15:21,404 INFO L93 Difference]: Finished difference Result 216 states and 380 transitions. [2025-01-09 11:15:21,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:15:21,406 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 212 [2025-01-09 11:15:21,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:15:21,411 INFO L225 Difference]: With dead ends: 216 [2025-01-09 11:15:21,411 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 11:15:21,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 213 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 11:15:21,416 INFO L435 NwaCegarLoop]: 171 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, 171 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 11:15:21,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:15:21,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 11:15:21,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-01-09 11:15:21,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 73 states have internal predecessors, (105), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 11:15:21,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 171 transitions. [2025-01-09 11:15:21,449 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 171 transitions. Word has length 212 [2025-01-09 11:15:21,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:15:21,450 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 171 transitions. [2025-01-09 11:15:21,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 11:15:21,450 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 171 transitions. [2025-01-09 11:15:21,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 11:15:21,453 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:15:21,453 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:15:21,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 11:15:21,658 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 11:15:21,659 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:15:21,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:15:21,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1338879816, now seen corresponding path program 1 times [2025-01-09 11:15:21,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:15:21,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122412169] [2025-01-09 11:15:21,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:15:21,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:15:21,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 11:15:21,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 11:15:21,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:15:21,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:15:22,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:15:22,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:15:22,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122412169] [2025-01-09 11:15:22,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122412169] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:15:22,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:15:22,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:15:22,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119209571] [2025-01-09 11:15:22,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:15:22,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:15:22,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:15:22,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:15:22,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:15:22,195 INFO L87 Difference]: Start difference. First operand 108 states and 171 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:15:22,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:15:22,435 INFO L93 Difference]: Finished difference Result 358 states and 571 transitions. [2025-01-09 11:15:22,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:15:22,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212 [2025-01-09 11:15:22,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:15:22,439 INFO L225 Difference]: With dead ends: 358 [2025-01-09 11:15:22,439 INFO L226 Difference]: Without dead ends: 253 [2025-01-09 11:15:22,440 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 11:15:22,444 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 173 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:15:22,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 550 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:15:22,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-01-09 11:15:22,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 221. [2025-01-09 11:15:22,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 152 states have internal predecessors, (223), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 11:15:22,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 355 transitions. [2025-01-09 11:15:22,484 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 355 transitions. Word has length 212 [2025-01-09 11:15:22,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:15:22,485 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 355 transitions. [2025-01-09 11:15:22,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:15:22,485 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 355 transitions. [2025-01-09 11:15:22,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-01-09 11:15:22,487 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:15:22,487 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:15:22,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:15:22,487 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:15:22,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:15:22,488 INFO L85 PathProgramCache]: Analyzing trace with hash -278203794, now seen corresponding path program 1 times [2025-01-09 11:15:22,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:15:22,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162165996] [2025-01-09 11:15:22,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:15:22,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:15:22,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 11:15:22,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 11:15:22,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:15:22,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:15:22,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:15:22,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:15:22,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162165996] [2025-01-09 11:15:22,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162165996] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:15:22,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:15:22,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:15:22,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509780753] [2025-01-09 11:15:22,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:15:22,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:15:22,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:15:22,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:15:22,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:15:22,770 INFO L87 Difference]: Start difference. First operand 221 states and 355 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:15:23,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:15:23,110 INFO L93 Difference]: Finished difference Result 648 states and 1042 transitions. [2025-01-09 11:15:23,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:15:23,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 213 [2025-01-09 11:15:23,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:15:23,114 INFO L225 Difference]: With dead ends: 648 [2025-01-09 11:15:23,114 INFO L226 Difference]: Without dead ends: 430 [2025-01-09 11:15:23,116 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 11:15:23,116 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 197 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:15:23,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 614 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 11:15:23,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-01-09 11:15:23,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 225. [2025-01-09 11:15:23,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 156 states have (on average 1.455128205128205) internal successors, (227), 156 states have internal predecessors, (227), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 11:15:23,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 359 transitions. [2025-01-09 11:15:23,147 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 359 transitions. Word has length 213 [2025-01-09 11:15:23,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:15:23,148 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 359 transitions. [2025-01-09 11:15:23,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:15:23,148 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 359 transitions. [2025-01-09 11:15:23,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 11:15:23,150 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:15:23,150 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:15:23,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:15:23,150 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:15:23,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:15:23,151 INFO L85 PathProgramCache]: Analyzing trace with hash 55305341, now seen corresponding path program 1 times [2025-01-09 11:15:23,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:15:23,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685180752] [2025-01-09 11:15:23,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:15:23,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:15:23,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 11:15:23,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 11:15:23,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:15:23,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:15:23,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:15:23,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:15:23,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685180752] [2025-01-09 11:15:23,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685180752] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:15:23,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:15:23,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:15:23,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783736049] [2025-01-09 11:15:23,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:15:23,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:15:23,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:15:23,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:15:23,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:15:23,420 INFO L87 Difference]: Start difference. First operand 225 states and 359 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:15:23,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:15:23,619 INFO L93 Difference]: Finished difference Result 596 states and 950 transitions. [2025-01-09 11:15:23,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:15:23,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-01-09 11:15:23,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:15:23,625 INFO L225 Difference]: With dead ends: 596 [2025-01-09 11:15:23,625 INFO L226 Difference]: Without dead ends: 374 [2025-01-09 11:15:23,626 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 11:15:23,627 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 126 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:15:23,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 651 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:15:23,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-01-09 11:15:23,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 286. [2025-01-09 11:15:23,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 183 states have (on average 1.4043715846994536) internal successors, (257), 183 states have internal predecessors, (257), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 11:15:23,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 455 transitions. [2025-01-09 11:15:23,670 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 455 transitions. Word has length 214 [2025-01-09 11:15:23,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:15:23,671 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 455 transitions. [2025-01-09 11:15:23,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:15:23,671 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 455 transitions. [2025-01-09 11:15:23,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 11:15:23,674 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:15:23,674 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:15:23,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 11:15:23,675 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:15:23,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:15:23,675 INFO L85 PathProgramCache]: Analyzing trace with hash -85243269, now seen corresponding path program 1 times [2025-01-09 11:15:23,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:15:23,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285466494] [2025-01-09 11:15:23,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:15:23,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:15:23,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 11:15:23,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 11:15:23,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:15:23,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:15:31,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:15:31,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:15:31,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285466494] [2025-01-09 11:15:31,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285466494] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:15:31,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:15:31,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 11:15:31,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000787088] [2025-01-09 11:15:31,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:15:31,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 11:15:31,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:15:31,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 11:15:31,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-01-09 11:15:31,207 INFO L87 Difference]: Start difference. First operand 286 states and 455 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:15:34,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:15:34,886 INFO L93 Difference]: Finished difference Result 720 states and 1124 transitions. [2025-01-09 11:15:34,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 11:15:34,886 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-01-09 11:15:34,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:15:34,890 INFO L225 Difference]: With dead ends: 720 [2025-01-09 11:15:34,890 INFO L226 Difference]: Without dead ends: 498 [2025-01-09 11:15:34,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2025-01-09 11:15:34,893 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 568 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 11:15:34,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1011 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 11:15:34,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-01-09 11:15:34,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 336. [2025-01-09 11:15:34,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 233 states have (on average 1.4506437768240343) internal successors, (338), 233 states have internal predecessors, (338), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 11:15:34,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 536 transitions. [2025-01-09 11:15:34,925 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 536 transitions. Word has length 214 [2025-01-09 11:15:34,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:15:34,925 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 536 transitions. [2025-01-09 11:15:34,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:15:34,927 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 536 transitions. [2025-01-09 11:15:34,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 11:15:34,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:15:34,930 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:15:34,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 11:15:34,931 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:15:34,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:15:34,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1689764093, now seen corresponding path program 1 times [2025-01-09 11:15:34,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:15:34,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845275752] [2025-01-09 11:15:34,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:15:34,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:15:34,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 11:15:35,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 11:15:35,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:15:35,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:15:36,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:15:36,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:15:36,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845275752] [2025-01-09 11:15:36,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845275752] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:15:36,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:15:36,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 11:15:36,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007040357] [2025-01-09 11:15:36,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:15:36,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 11:15:36,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:15:36,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 11:15:36,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 11:15:36,692 INFO L87 Difference]: Start difference. First operand 336 states and 536 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:15:37,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:15:37,736 INFO L93 Difference]: Finished difference Result 778 states and 1221 transitions. [2025-01-09 11:15:37,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 11:15:37,741 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-01-09 11:15:37,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:15:37,744 INFO L225 Difference]: With dead ends: 778 [2025-01-09 11:15:37,744 INFO L226 Difference]: Without dead ends: 556 [2025-01-09 11:15:37,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-01-09 11:15:37,751 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 503 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 11:15:37,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 668 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 11:15:37,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-01-09 11:15:37,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 398. [2025-01-09 11:15:37,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 295 states have (on average 1.4847457627118643) internal successors, (438), 295 states have internal predecessors, (438), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 11:15:37,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 636 transitions. [2025-01-09 11:15:37,811 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 636 transitions. Word has length 214 [2025-01-09 11:15:37,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:15:37,811 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 636 transitions. [2025-01-09 11:15:37,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:15:37,812 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 636 transitions. [2025-01-09 11:15:37,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 11:15:37,818 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:15:37,818 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:15:37,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 11:15:37,818 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:15:37,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:15:37,818 INFO L85 PathProgramCache]: Analyzing trace with hash 594815101, now seen corresponding path program 1 times [2025-01-09 11:15:37,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:15:37,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788997716] [2025-01-09 11:15:37,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:15:37,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:15:37,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 11:15:37,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 11:15:37,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:15:37,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:15:39,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:15:39,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:15:39,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788997716] [2025-01-09 11:15:39,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788997716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:15:39,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:15:39,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 11:15:39,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506852976] [2025-01-09 11:15:39,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:15:39,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 11:15:39,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:15:39,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 11:15:39,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 11:15:39,508 INFO L87 Difference]: Start difference. First operand 398 states and 636 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:15:40,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:15:40,575 INFO L93 Difference]: Finished difference Result 891 states and 1395 transitions. [2025-01-09 11:15:40,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 11:15:40,575 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-01-09 11:15:40,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:15:40,578 INFO L225 Difference]: With dead ends: 891 [2025-01-09 11:15:40,578 INFO L226 Difference]: Without dead ends: 606 [2025-01-09 11:15:40,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-01-09 11:15:40,579 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 412 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 11:15:40,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 734 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 11:15:40,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-01-09 11:15:40,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 530. [2025-01-09 11:15:40,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 427 states have (on average 1.494145199063232) internal successors, (638), 427 states have internal predecessors, (638), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 11:15:40,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 836 transitions. [2025-01-09 11:15:40,621 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 836 transitions. Word has length 214 [2025-01-09 11:15:40,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:15:40,621 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 836 transitions. [2025-01-09 11:15:40,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:15:40,621 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 836 transitions. [2025-01-09 11:15:40,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 11:15:40,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:15:40,624 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:15:40,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 11:15:40,624 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:15:40,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:15:40,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1355376340, now seen corresponding path program 1 times [2025-01-09 11:15:40,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:15:40,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762549873] [2025-01-09 11:15:40,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:15:40,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:15:40,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 11:15:40,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 11:15:40,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:15:40,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:15:41,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:15:41,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:15:41,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762549873] [2025-01-09 11:15:41,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762549873] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:15:41,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:15:41,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 11:15:41,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236130225] [2025-01-09 11:15:41,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:15:41,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 11:15:41,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:15:41,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 11:15:41,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 11:15:41,676 INFO L87 Difference]: Start difference. First operand 530 states and 836 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:15:42,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:15:42,022 INFO L93 Difference]: Finished difference Result 894 states and 1392 transitions. [2025-01-09 11:15:42,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 11:15:42,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-01-09 11:15:42,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:15:42,027 INFO L225 Difference]: With dead ends: 894 [2025-01-09 11:15:42,027 INFO L226 Difference]: Without dead ends: 626 [2025-01-09 11:15:42,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 11:15:42,028 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 217 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:15:42,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 614 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 11:15:42,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-01-09 11:15:42,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 532. [2025-01-09 11:15:42,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 429 states have (on average 1.4825174825174825) internal successors, (636), 429 states have internal predecessors, (636), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 11:15:42,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 834 transitions. [2025-01-09 11:15:42,068 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 834 transitions. Word has length 214 [2025-01-09 11:15:42,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:15:42,069 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 834 transitions. [2025-01-09 11:15:42,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:15:42,069 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 834 transitions. [2025-01-09 11:15:42,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 11:15:42,070 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:15:42,070 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:15:42,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 11:15:42,071 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:15:42,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:15:42,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1106311623, now seen corresponding path program 1 times [2025-01-09 11:15:42,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:15:42,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360363490] [2025-01-09 11:15:42,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:15:42,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:15:42,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 11:15:42,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 11:15:42,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:15:42,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:15:42,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:15:42,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:15:42,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360363490] [2025-01-09 11:15:42,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360363490] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:15:42,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:15:42,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:15:42,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100107316] [2025-01-09 11:15:42,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:15:42,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:15:42,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:15:42,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:15:42,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:15:42,380 INFO L87 Difference]: Start difference. First operand 532 states and 834 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:15:42,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:15:42,586 INFO L93 Difference]: Finished difference Result 810 states and 1271 transitions. [2025-01-09 11:15:42,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:15:42,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-01-09 11:15:42,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:15:42,589 INFO L225 Difference]: With dead ends: 810 [2025-01-09 11:15:42,589 INFO L226 Difference]: Without dead ends: 520 [2025-01-09 11:15:42,589 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 11:15:42,590 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 106 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:15:42,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 439 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:15:42,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-01-09 11:15:42,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 492. [2025-01-09 11:15:42,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 389 states have (on average 1.4652956298200515) internal successors, (570), 389 states have internal predecessors, (570), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 11:15:42,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 768 transitions. [2025-01-09 11:15:42,618 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 768 transitions. Word has length 214 [2025-01-09 11:15:42,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:15:42,619 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 768 transitions. [2025-01-09 11:15:42,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:15:42,619 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 768 transitions. [2025-01-09 11:15:42,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-01-09 11:15:42,620 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:15:42,620 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:15:42,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 11:15:42,620 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:15:42,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:15:42,621 INFO L85 PathProgramCache]: Analyzing trace with hash 921880229, now seen corresponding path program 1 times [2025-01-09 11:15:42,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:15:42,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396157859] [2025-01-09 11:15:42,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:15:42,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:15:42,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 11:15:42,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 11:15:42,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:15:42,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:15:44,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:15:44,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:15:44,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396157859] [2025-01-09 11:15:44,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396157859] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:15:44,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:15:44,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 11:15:44,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439989653] [2025-01-09 11:15:44,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:15:44,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 11:15:44,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:15:44,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 11:15:44,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 11:15:44,606 INFO L87 Difference]: Start difference. First operand 492 states and 768 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:15:45,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:15:45,651 INFO L93 Difference]: Finished difference Result 901 states and 1379 transitions. [2025-01-09 11:15:45,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 11:15:45,651 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 215 [2025-01-09 11:15:45,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:15:45,655 INFO L225 Difference]: With dead ends: 901 [2025-01-09 11:15:45,656 INFO L226 Difference]: Without dead ends: 679 [2025-01-09 11:15:45,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-01-09 11:15:45,658 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 302 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 11:15:45,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 939 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 11:15:45,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-01-09 11:15:45,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 508. [2025-01-09 11:15:45,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 403 states have (on average 1.4540942928039702) internal successors, (586), 403 states have internal predecessors, (586), 99 states have call successors, (99), 5 states have call predecessors, (99), 5 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 11:15:45,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 784 transitions. [2025-01-09 11:15:45,692 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 784 transitions. Word has length 215 [2025-01-09 11:15:45,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:15:45,692 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 784 transitions. [2025-01-09 11:15:45,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:15:45,693 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 784 transitions. [2025-01-09 11:15:45,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-01-09 11:15:45,694 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:15:45,695 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:15:45,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 11:15:45,695 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:15:45,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:15:45,695 INFO L85 PathProgramCache]: Analyzing trace with hash -463414260, now seen corresponding path program 1 times [2025-01-09 11:15:45,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:15:45,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69965375] [2025-01-09 11:15:45,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:15:45,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:15:45,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 11:15:45,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 11:15:45,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:15:45,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:15:47,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:15:47,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:15:47,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69965375] [2025-01-09 11:15:47,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69965375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:15:47,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:15:47,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 11:15:47,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225131200] [2025-01-09 11:15:47,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:15:47,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 11:15:47,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:15:47,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 11:15:47,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-01-09 11:15:47,779 INFO L87 Difference]: Start difference. First operand 508 states and 784 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:15:49,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:15:49,606 INFO L93 Difference]: Finished difference Result 1205 states and 1837 transitions. [2025-01-09 11:15:49,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 11:15:49,606 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 215 [2025-01-09 11:15:49,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:15:49,609 INFO L225 Difference]: With dead ends: 1205 [2025-01-09 11:15:49,609 INFO L226 Difference]: Without dead ends: 895 [2025-01-09 11:15:49,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2025-01-09 11:15:49,610 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 328 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:15:49,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 1078 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 11:15:49,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-01-09 11:15:49,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 647. [2025-01-09 11:15:49,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 542 states have (on average 1.477859778597786) internal successors, (801), 542 states have internal predecessors, (801), 99 states have call successors, (99), 5 states have call predecessors, (99), 5 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 11:15:49,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 999 transitions. [2025-01-09 11:15:49,641 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 999 transitions. Word has length 215 [2025-01-09 11:15:49,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:15:49,641 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 999 transitions. [2025-01-09 11:15:49,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:15:49,641 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 999 transitions. [2025-01-09 11:15:49,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-01-09 11:15:49,642 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:15:49,643 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:15:49,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 11:15:49,643 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:15:49,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:15:49,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1396795610, now seen corresponding path program 1 times [2025-01-09 11:15:49,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:15:49,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068369430] [2025-01-09 11:15:49,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:15:49,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:15:49,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 11:15:49,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 11:15:49,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:15:49,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:15:56,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:15:56,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:15:56,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068369430] [2025-01-09 11:15:56,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068369430] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:15:56,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:15:56,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 11:15:56,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76853602] [2025-01-09 11:15:56,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:15:56,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 11:15:56,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:15:56,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 11:15:56,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-01-09 11:15:56,805 INFO L87 Difference]: Start difference. First operand 647 states and 999 transitions. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:15:59,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:15:59,295 INFO L93 Difference]: Finished difference Result 1101 states and 1676 transitions. [2025-01-09 11:15:59,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 11:15:59,296 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 216 [2025-01-09 11:15:59,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:15:59,298 INFO L225 Difference]: With dead ends: 1101 [2025-01-09 11:15:59,298 INFO L226 Difference]: Without dead ends: 751 [2025-01-09 11:15:59,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=152, Invalid=550, Unknown=0, NotChecked=0, Total=702 [2025-01-09 11:15:59,300 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 455 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:15:59,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1020 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 11:15:59,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-01-09 11:15:59,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 637. [2025-01-09 11:15:59,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 532 states have (on average 1.4830827067669172) internal successors, (789), 532 states have internal predecessors, (789), 99 states have call successors, (99), 5 states have call predecessors, (99), 5 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 11:15:59,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 987 transitions. [2025-01-09 11:15:59,330 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 987 transitions. Word has length 216 [2025-01-09 11:15:59,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:15:59,330 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 987 transitions. [2025-01-09 11:15:59,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:15:59,331 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 987 transitions. [2025-01-09 11:15:59,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-01-09 11:15:59,332 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:15:59,332 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:15:59,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 11:15:59,332 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:15:59,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:15:59,333 INFO L85 PathProgramCache]: Analyzing trace with hash 776037664, now seen corresponding path program 1 times [2025-01-09 11:15:59,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:15:59,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938515586] [2025-01-09 11:15:59,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:15:59,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:15:59,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 11:15:59,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 11:15:59,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:15:59,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:16:02,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:16:02,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:16:02,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938515586] [2025-01-09 11:16:02,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938515586] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:16:02,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:16:02,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 11:16:02,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032186665] [2025-01-09 11:16:02,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:16:02,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 11:16:02,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:16:02,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 11:16:02,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 11:16:02,697 INFO L87 Difference]: Start difference. First operand 637 states and 987 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:16:08,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:16:08,937 INFO L93 Difference]: Finished difference Result 1247 states and 1893 transitions. [2025-01-09 11:16:08,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 11:16:08,938 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 216 [2025-01-09 11:16:08,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:16:08,945 INFO L225 Difference]: With dead ends: 1247 [2025-01-09 11:16:08,948 INFO L226 Difference]: Without dead ends: 897 [2025-01-09 11:16:08,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2025-01-09 11:16:08,950 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 425 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-09 11:16:08,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 860 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-09 11:16:08,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2025-01-09 11:16:08,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 663. [2025-01-09 11:16:08,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 558 states have (on average 1.478494623655914) internal successors, (825), 558 states have internal predecessors, (825), 99 states have call successors, (99), 5 states have call predecessors, (99), 5 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 11:16:08,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1023 transitions. [2025-01-09 11:16:08,986 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1023 transitions. Word has length 216 [2025-01-09 11:16:08,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:16:08,986 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 1023 transitions. [2025-01-09 11:16:08,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:16:08,987 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1023 transitions. [2025-01-09 11:16:08,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-01-09 11:16:08,988 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:16:08,988 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:16:08,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 11:16:08,988 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:16:08,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:16:08,989 INFO L85 PathProgramCache]: Analyzing trace with hash -318911328, now seen corresponding path program 1 times [2025-01-09 11:16:08,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:16:08,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504552710] [2025-01-09 11:16:08,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:16:08,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:16:08,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 11:16:09,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 11:16:09,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:16:09,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:16:11,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:16:11,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:16:11,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504552710] [2025-01-09 11:16:11,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504552710] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:16:11,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:16:11,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 11:16:11,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508330994] [2025-01-09 11:16:11,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:16:11,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 11:16:11,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:16:11,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 11:16:11,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 11:16:11,688 INFO L87 Difference]: Start difference. First operand 663 states and 1023 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:16:13,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:16:13,751 INFO L93 Difference]: Finished difference Result 1282 states and 1954 transitions. [2025-01-09 11:16:13,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 11:16:13,752 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 216 [2025-01-09 11:16:13,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:16:13,755 INFO L225 Difference]: With dead ends: 1282 [2025-01-09 11:16:13,755 INFO L226 Difference]: Without dead ends: 825 [2025-01-09 11:16:13,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2025-01-09 11:16:13,756 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 607 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:16:13,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 832 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 11:16:13,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2025-01-09 11:16:13,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 673. [2025-01-09 11:16:13,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 568 states have (on average 1.471830985915493) internal successors, (836), 568 states have internal predecessors, (836), 99 states have call successors, (99), 5 states have call predecessors, (99), 5 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 11:16:13,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1034 transitions. [2025-01-09 11:16:13,793 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1034 transitions. Word has length 216 [2025-01-09 11:16:13,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:16:13,793 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 1034 transitions. [2025-01-09 11:16:13,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:16:13,794 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1034 transitions. [2025-01-09 11:16:13,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-01-09 11:16:13,795 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:16:13,795 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:16:13,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 11:16:13,795 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:16:13,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:16:13,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1456096034, now seen corresponding path program 1 times [2025-01-09 11:16:13,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:16:13,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381075018] [2025-01-09 11:16:13,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:16:13,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:16:13,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 11:16:13,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 11:16:13,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:16:13,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:16:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:16:19,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:16:19,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381075018] [2025-01-09 11:16:19,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381075018] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:16:19,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:16:19,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 11:16:19,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916822739] [2025-01-09 11:16:19,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:16:19,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 11:16:19,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:16:19,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 11:16:19,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-09 11:16:19,814 INFO L87 Difference]: Start difference. First operand 673 states and 1034 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:16:21,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:16:21,884 INFO L93 Difference]: Finished difference Result 1177 states and 1769 transitions. [2025-01-09 11:16:21,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 11:16:21,884 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 216 [2025-01-09 11:16:21,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:16:21,888 INFO L225 Difference]: With dead ends: 1177 [2025-01-09 11:16:21,888 INFO L226 Difference]: Without dead ends: 807 [2025-01-09 11:16:21,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2025-01-09 11:16:21,889 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 444 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 11:16:21,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 928 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 11:16:21,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2025-01-09 11:16:21,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 681. [2025-01-09 11:16:21,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 576 states have (on average 1.4652777777777777) internal successors, (844), 576 states have internal predecessors, (844), 99 states have call successors, (99), 5 states have call predecessors, (99), 5 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 11:16:21,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1042 transitions. [2025-01-09 11:16:21,940 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1042 transitions. Word has length 216 [2025-01-09 11:16:21,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:16:21,941 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 1042 transitions. [2025-01-09 11:16:21,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:16:21,941 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1042 transitions. [2025-01-09 11:16:21,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-09 11:16:21,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:16:21,942 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:16:21,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 11:16:21,942 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:16:21,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:16:21,943 INFO L85 PathProgramCache]: Analyzing trace with hash -172148897, now seen corresponding path program 1 times [2025-01-09 11:16:21,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:16:21,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789891100] [2025-01-09 11:16:21,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:16:21,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:16:21,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 11:16:21,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 11:16:21,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:16:21,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:16:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:16:41,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:16:41,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789891100] [2025-01-09 11:16:41,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789891100] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:16:41,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:16:41,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 11:16:41,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214799479] [2025-01-09 11:16:41,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:16:41,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 11:16:41,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:16:41,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 11:16:41,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-01-09 11:16:41,856 INFO L87 Difference]: Start difference. First operand 681 states and 1042 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 11:16:43,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:16:43,043 INFO L93 Difference]: Finished difference Result 1035 states and 1540 transitions. [2025-01-09 11:16:43,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 11:16:43,044 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 217 [2025-01-09 11:16:43,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:16:43,047 INFO L225 Difference]: With dead ends: 1035 [2025-01-09 11:16:43,047 INFO L226 Difference]: Without dead ends: 1033 [2025-01-09 11:16:43,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2025-01-09 11:16:43,048 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 441 mSDsluCounter, 1296 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1450 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 11:16:43,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1450 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 11:16:43,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2025-01-09 11:16:43,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 771. [2025-01-09 11:16:43,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 666 states have (on average 1.46996996996997) internal successors, (979), 666 states have internal predecessors, (979), 99 states have call successors, (99), 5 states have call predecessors, (99), 5 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 11:16:43,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1177 transitions. [2025-01-09 11:16:43,090 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1177 transitions. Word has length 217 [2025-01-09 11:16:43,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:16:43,090 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1177 transitions. [2025-01-09 11:16:43,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 11:16:43,090 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1177 transitions. [2025-01-09 11:16:43,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-09 11:16:43,092 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:16:43,092 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:16:43,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 11:16:43,092 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:16:43,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:16:43,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1751079137, now seen corresponding path program 1 times [2025-01-09 11:16:43,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:16:43,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684513065] [2025-01-09 11:16:43,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:16:43,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:16:43,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 11:16:43,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 11:16:43,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:16:43,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat