./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-66.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 366cd04e1cccaa3d248693408475f1d8f6198ae7da412e5cc3eb2ead8f221652 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:19:40,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:19:40,867 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:19:40,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:19:40,873 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:19:40,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:19:40,892 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:19:40,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:19:40,892 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:19:40,892 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:19:40,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:19:40,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:19:40,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:19:40,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:19:40,893 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:19:40,893 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:19:40,893 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:19:40,893 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:19:40,893 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:19:40,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:19:40,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:19:40,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:19:40,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:19:40,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:19:40,893 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:19:40,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:19:40,893 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:19:40,893 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:19:40,893 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:19:40,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:19:40,893 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:19:40,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:19:40,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:19:40,894 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:19:40,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:19:40,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:19:40,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:19:40,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:19:40,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:19:40,894 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:19:40,894 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:19:40,894 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:19:40,894 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:19:40,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:19:40,894 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:19:40,894 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:19:40,894 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:19:40,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:19:40,894 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 -> 366cd04e1cccaa3d248693408475f1d8f6198ae7da412e5cc3eb2ead8f221652 [2025-01-09 11:19:41,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:19:41,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:19:41,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:19:41,101 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:19:41,102 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:19:41,102 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-66.i [2025-01-09 11:19:42,294 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/baa18a720/ab725f7cce7844a8ada0d7ee6450ed5e/FLAGf9aadc438 [2025-01-09 11:19:42,566 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:19:42,567 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-66.i [2025-01-09 11:19:42,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/baa18a720/ab725f7cce7844a8ada0d7ee6450ed5e/FLAGf9aadc438 [2025-01-09 11:19:42,585 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/baa18a720/ab725f7cce7844a8ada0d7ee6450ed5e [2025-01-09 11:19:42,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:19:42,587 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:19:42,592 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:19:42,592 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:19:42,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:19:42,596 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:19:42" (1/1) ... [2025-01-09 11:19:42,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bb92a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:19:42, skipping insertion in model container [2025-01-09 11:19:42,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:19:42" (1/1) ... [2025-01-09 11:19:42,616 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:19:42,721 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-66.i[919,932] [2025-01-09 11:19:42,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:19:42,792 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:19:42,800 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-66.i[919,932] [2025-01-09 11:19:42,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:19:42,835 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:19:42,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:19:42 WrapperNode [2025-01-09 11:19:42,836 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:19:42,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:19:42,837 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:19:42,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:19:42,844 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:19:42" (1/1) ... [2025-01-09 11:19:42,855 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:19:42" (1/1) ... [2025-01-09 11:19:42,881 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 250 [2025-01-09 11:19:42,882 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:19:42,882 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:19:42,882 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:19:42,882 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:19:42,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:19:42" (1/1) ... [2025-01-09 11:19:42,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:19:42" (1/1) ... [2025-01-09 11:19:42,901 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:19:42" (1/1) ... [2025-01-09 11:19:42,914 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:19:42,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:19:42" (1/1) ... [2025-01-09 11:19:42,914 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:19:42" (1/1) ... [2025-01-09 11:19:42,929 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:19:42" (1/1) ... [2025-01-09 11:19:42,929 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:19:42" (1/1) ... [2025-01-09 11:19:42,931 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:19:42" (1/1) ... [2025-01-09 11:19:42,934 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:19:42" (1/1) ... [2025-01-09 11:19:42,935 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:19:42" (1/1) ... [2025-01-09 11:19:42,937 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:19:42,937 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:19:42,937 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:19:42,937 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:19:42,939 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:19:42" (1/1) ... [2025-01-09 11:19:42,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:19:42,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:19:42,968 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:19:42,972 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:19:42,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:19:42,987 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:19:42,987 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:19:42,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:19:42,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:19:42,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:19:43,049 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:19:43,050 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:19:43,296 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 11:19:43,296 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:19:43,303 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:19:43,303 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:19:43,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:19:43 BoogieIcfgContainer [2025-01-09 11:19:43,304 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:19:43,305 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:19:43,305 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:19:43,308 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:19:43,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:19:42" (1/3) ... [2025-01-09 11:19:43,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@598486e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:19:43, skipping insertion in model container [2025-01-09 11:19:43,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:19:42" (2/3) ... [2025-01-09 11:19:43,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@598486e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:19:43, skipping insertion in model container [2025-01-09 11:19:43,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:19:43" (3/3) ... [2025-01-09 11:19:43,310 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-66.i [2025-01-09 11:19:43,318 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:19:43,320 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-66.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:19:43,355 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:19:43,362 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;@20927d27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:19:43,362 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:19:43,364 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 67 states have internal predecessors, (93), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 11:19:43,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 11:19:43,378 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:19:43,379 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:43,379 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:19:43,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:19:43,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1642959570, now seen corresponding path program 1 times [2025-01-09 11:19:43,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:19:43,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28837400] [2025-01-09 11:19:43,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:19:43,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:19:43,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 11:19:43,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 11:19:43,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:19:43,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:19:43,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2025-01-09 11:19:43,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:19:43,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28837400] [2025-01-09 11:19:43,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28837400] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:19:43,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107803535] [2025-01-09 11:19:43,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:19:43,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:19:43,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:19:43,730 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:19:43,732 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:19:43,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 11:19:43,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 11:19:43,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:19:43,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:19:43,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:19:43,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:19:43,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2025-01-09 11:19:43,951 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:19:43,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107803535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:19:43,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:19:43,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 11:19:43,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804012027] [2025-01-09 11:19:43,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:19:43,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:19:43,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:19:43,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:19:43,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:19:43,973 INFO L87 Difference]: Start difference. First operand has 113 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 67 states have internal predecessors, (93), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2025-01-09 11:19:44,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:19:44,003 INFO L93 Difference]: Finished difference Result 220 states and 401 transitions. [2025-01-09 11:19:44,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:19:44,004 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) Word has length 270 [2025-01-09 11:19:44,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:19:44,008 INFO L225 Difference]: With dead ends: 220 [2025-01-09 11:19:44,008 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 11:19:44,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 271 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:19:44,012 INFO L435 NwaCegarLoop]: 176 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, 176 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:19:44,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:19:44,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 11:19:44,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-01-09 11:19:44,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 64 states have (on average 1.375) internal successors, (88), 64 states have internal predecessors, (88), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 11:19:44,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 176 transitions. [2025-01-09 11:19:44,048 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 176 transitions. Word has length 270 [2025-01-09 11:19:44,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:19:44,049 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 176 transitions. [2025-01-09 11:19:44,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2025-01-09 11:19:44,049 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 176 transitions. [2025-01-09 11:19:44,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 11:19:44,052 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:19:44,052 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:44,063 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:19:44,257 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:19:44,258 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:19:44,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:19:44,259 INFO L85 PathProgramCache]: Analyzing trace with hash -67240050, now seen corresponding path program 1 times [2025-01-09 11:19:44,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:19:44,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076995477] [2025-01-09 11:19:44,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:19:44,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:19:44,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 11:19:44,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 11:19:44,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:19:44,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:19:44,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 11:19:44,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:19:44,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076995477] [2025-01-09 11:19:44,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076995477] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:19:44,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:19:44,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:19:44,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812909509] [2025-01-09 11:19:44,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:19:44,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:19:44,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:19:44,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:19:44,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:19:44,518 INFO L87 Difference]: Start difference. First operand 110 states and 176 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 11:19:44,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:19:44,591 INFO L93 Difference]: Finished difference Result 323 states and 520 transitions. [2025-01-09 11:19:44,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:19:44,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2025-01-09 11:19:44,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:19:44,594 INFO L225 Difference]: With dead ends: 323 [2025-01-09 11:19:44,594 INFO L226 Difference]: Without dead ends: 216 [2025-01-09 11:19:44,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:19:44,598 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 163 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:19:44,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 336 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:19:44,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-01-09 11:19:44,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2025-01-09 11:19:44,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 123 states have (on average 1.3495934959349594) internal successors, (166), 123 states have internal predecessors, (166), 88 states have call successors, (88), 2 states have call predecessors, (88), 2 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 11:19:44,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 342 transitions. [2025-01-09 11:19:44,639 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 342 transitions. Word has length 270 [2025-01-09 11:19:44,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:19:44,641 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 342 transitions. [2025-01-09 11:19:44,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 11:19:44,641 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 342 transitions. [2025-01-09 11:19:44,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 11:19:44,646 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:19:44,646 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:44,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:19:44,647 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:19:44,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:19:44,648 INFO L85 PathProgramCache]: Analyzing trace with hash -768304628, now seen corresponding path program 1 times [2025-01-09 11:19:44,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:19:44,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527955257] [2025-01-09 11:19:44,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:19:44,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:19:44,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 11:19:44,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 11:19:44,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:19:44,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:20:03,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 11:20:03,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:20:03,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527955257] [2025-01-09 11:20:03,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527955257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:20:03,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:20:03,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 11:20:03,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691456988] [2025-01-09 11:20:03,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:20:03,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 11:20:03,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:20:03,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 11:20:03,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-01-09 11:20:03,617 INFO L87 Difference]: Start difference. First operand 214 states and 342 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 11:20:04,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:20:04,720 INFO L93 Difference]: Finished difference Result 385 states and 596 transitions. [2025-01-09 11:20:04,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 11:20:04,724 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2025-01-09 11:20:04,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:20:04,726 INFO L225 Difference]: With dead ends: 385 [2025-01-09 11:20:04,726 INFO L226 Difference]: Without dead ends: 383 [2025-01-09 11:20:04,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-01-09 11:20:04,731 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 202 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 11:20:04,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1239 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 11:20:04,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-01-09 11:20:04,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 246. [2025-01-09 11:20:04,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 155 states have (on average 1.4129032258064516) internal successors, (219), 155 states have internal predecessors, (219), 88 states have call successors, (88), 2 states have call predecessors, (88), 2 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 11:20:04,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 395 transitions. [2025-01-09 11:20:04,771 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 395 transitions. Word has length 270 [2025-01-09 11:20:04,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:20:04,772 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 395 transitions. [2025-01-09 11:20:04,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 11:20:04,773 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 395 transitions. [2025-01-09 11:20:04,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 11:20:04,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:20:04,776 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:04,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:20:04,776 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:20:04,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:20:04,777 INFO L85 PathProgramCache]: Analyzing trace with hash -766457586, now seen corresponding path program 1 times [2025-01-09 11:20:04,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:20:04,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697323397] [2025-01-09 11:20:04,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:20:04,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:20:04,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 11:20:04,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 11:20:04,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:20:04,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:20:08,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 11:20:08,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:20:08,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697323397] [2025-01-09 11:20:08,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697323397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:20:08,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:20:08,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 11:20:08,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392342922] [2025-01-09 11:20:08,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:20:08,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 11:20:08,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:20:08,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 11:20:08,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-01-09 11:20:08,795 INFO L87 Difference]: Start difference. First operand 246 states and 395 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 11:20:11,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:20:11,315 INFO L93 Difference]: Finished difference Result 446 states and 671 transitions. [2025-01-09 11:20:11,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 11:20:11,317 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2025-01-09 11:20:11,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:20:11,320 INFO L225 Difference]: With dead ends: 446 [2025-01-09 11:20:11,320 INFO L226 Difference]: Without dead ends: 444 [2025-01-09 11:20:11,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-01-09 11:20:11,321 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 244 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:20:11,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 1656 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 11:20:11,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-01-09 11:20:11,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 321. [2025-01-09 11:20:11,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 220 states have (on average 1.440909090909091) internal successors, (317), 222 states have internal predecessors, (317), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 94 states have call predecessors, (96), 96 states have call successors, (96) [2025-01-09 11:20:11,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 509 transitions. [2025-01-09 11:20:11,405 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 509 transitions. Word has length 270 [2025-01-09 11:20:11,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:20:11,406 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 509 transitions. [2025-01-09 11:20:11,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 11:20:11,406 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 509 transitions. [2025-01-09 11:20:11,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 11:20:11,413 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:20:11,414 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:11,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 11:20:11,414 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:20:11,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:20:11,414 INFO L85 PathProgramCache]: Analyzing trace with hash -510139190, now seen corresponding path program 1 times [2025-01-09 11:20:11,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:20:11,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369290424] [2025-01-09 11:20:11,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:20:11,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:20:11,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 11:20:11,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 11:20:11,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:20:11,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:20:14,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 11:20:14,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:20:14,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369290424] [2025-01-09 11:20:14,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369290424] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:20:14,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:20:14,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 11:20:14,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816903297] [2025-01-09 11:20:14,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:20:14,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 11:20:14,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:20:14,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 11:20:14,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-01-09 11:20:14,892 INFO L87 Difference]: Start difference. First operand 321 states and 509 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 11:20:15,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:20:15,575 INFO L93 Difference]: Finished difference Result 452 states and 679 transitions. [2025-01-09 11:20:15,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 11:20:15,575 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2025-01-09 11:20:15,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:20:15,580 INFO L225 Difference]: With dead ends: 452 [2025-01-09 11:20:15,580 INFO L226 Difference]: Without dead ends: 450 [2025-01-09 11:20:15,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-01-09 11:20:15,580 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 300 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:20:15,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1141 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 11:20:15,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-01-09 11:20:15,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 325. [2025-01-09 11:20:15,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 224 states have (on average 1.4464285714285714) internal successors, (324), 226 states have internal predecessors, (324), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 94 states have call predecessors, (96), 96 states have call successors, (96) [2025-01-09 11:20:15,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 516 transitions. [2025-01-09 11:20:15,633 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 516 transitions. Word has length 270 [2025-01-09 11:20:15,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:20:15,634 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 516 transitions. [2025-01-09 11:20:15,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 11:20:15,634 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 516 transitions. [2025-01-09 11:20:15,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 11:20:15,635 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:20:15,635 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:15,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 11:20:15,635 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:20:15,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:20:15,641 INFO L85 PathProgramCache]: Analyzing trace with hash -508292148, now seen corresponding path program 1 times [2025-01-09 11:20:15,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:20:15,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783024238] [2025-01-09 11:20:15,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:20:15,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:20:15,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 11:20:15,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 11:20:15,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:20:15,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:20:20,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 11:20:20,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:20:20,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783024238] [2025-01-09 11:20:20,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783024238] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:20:20,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:20:20,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 11:20:20,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157357830] [2025-01-09 11:20:20,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:20:20,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 11:20:20,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:20:20,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 11:20:20,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-01-09 11:20:20,801 INFO L87 Difference]: Start difference. First operand 325 states and 516 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 11:20:21,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:20:21,895 INFO L93 Difference]: Finished difference Result 450 states and 677 transitions. [2025-01-09 11:20:21,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 11:20:21,895 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2025-01-09 11:20:21,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:20:21,898 INFO L225 Difference]: With dead ends: 450 [2025-01-09 11:20:21,898 INFO L226 Difference]: Without dead ends: 448 [2025-01-09 11:20:21,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-01-09 11:20:21,899 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 203 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1539 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 11:20:21,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 1539 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 11:20:21,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-01-09 11:20:21,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 325. [2025-01-09 11:20:21,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 224 states have (on average 1.4464285714285714) internal successors, (324), 226 states have internal predecessors, (324), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 94 states have call predecessors, (96), 96 states have call successors, (96) [2025-01-09 11:20:21,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 516 transitions. [2025-01-09 11:20:21,919 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 516 transitions. Word has length 270 [2025-01-09 11:20:21,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:20:21,919 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 516 transitions. [2025-01-09 11:20:21,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 11:20:21,920 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 516 transitions. [2025-01-09 11:20:21,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 11:20:21,921 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:20:21,921 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:21,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 11:20:21,921 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:20:21,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:20:21,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1088308404, now seen corresponding path program 1 times [2025-01-09 11:20:21,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:20:21,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405572695] [2025-01-09 11:20:21,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:20:21,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:20:21,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 11:20:21,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 11:20:21,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:20:21,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:20:22,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 11:20:22,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:20:22,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405572695] [2025-01-09 11:20:22,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405572695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:20:22,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:20:22,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:20:22,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231345293] [2025-01-09 11:20:22,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:20:22,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:20:22,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:20:22,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:20:22,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:20:22,003 INFO L87 Difference]: Start difference. First operand 325 states and 516 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 11:20:22,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:20:22,219 INFO L93 Difference]: Finished difference Result 1019 states and 1598 transitions. [2025-01-09 11:20:22,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:20:22,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2025-01-09 11:20:22,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:20:22,224 INFO L225 Difference]: With dead ends: 1019 [2025-01-09 11:20:22,224 INFO L226 Difference]: Without dead ends: 697 [2025-01-09 11:20:22,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:20:22,225 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 134 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:20:22,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 580 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:20:22,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2025-01-09 11:20:22,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 592. [2025-01-09 11:20:22,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 391 states have (on average 1.432225063938619) internal successors, (560), 395 states have internal predecessors, (560), 192 states have call successors, (192), 8 states have call predecessors, (192), 8 states have return successors, (192), 188 states have call predecessors, (192), 192 states have call successors, (192) [2025-01-09 11:20:22,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 944 transitions. [2025-01-09 11:20:22,283 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 944 transitions. Word has length 270 [2025-01-09 11:20:22,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:20:22,284 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 944 transitions. [2025-01-09 11:20:22,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 11:20:22,285 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 944 transitions. [2025-01-09 11:20:22,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 11:20:22,288 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:20:22,288 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:22,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 11:20:22,289 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:20:22,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:20:22,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1789372982, now seen corresponding path program 1 times [2025-01-09 11:20:22,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:20:22,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481851049] [2025-01-09 11:20:22,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:20:22,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:20:22,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 11:20:22,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 11:20:22,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:20:22,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:20:22,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 11:20:22,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:20:22,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481851049] [2025-01-09 11:20:22,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481851049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:20:22,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:20:22,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:20:22,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095314080] [2025-01-09 11:20:22,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:20:22,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:20:22,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:20:22,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:20:22,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:20:22,346 INFO L87 Difference]: Start difference. First operand 592 states and 944 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 11:20:22,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:20:22,418 INFO L93 Difference]: Finished difference Result 1168 states and 1867 transitions. [2025-01-09 11:20:22,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:20:22,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2025-01-09 11:20:22,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:20:22,424 INFO L225 Difference]: With dead ends: 1168 [2025-01-09 11:20:22,426 INFO L226 Difference]: Without dead ends: 579 [2025-01-09 11:20:22,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:20:22,428 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 162 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:20:22,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 492 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:20:22,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-01-09 11:20:22,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 576. [2025-01-09 11:20:22,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 379 states have (on average 1.3878627968337731) internal successors, (526), 382 states have internal predecessors, (526), 188 states have call successors, (188), 8 states have call predecessors, (188), 8 states have return successors, (188), 185 states have call predecessors, (188), 188 states have call successors, (188) [2025-01-09 11:20:22,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 902 transitions. [2025-01-09 11:20:22,477 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 902 transitions. Word has length 270 [2025-01-09 11:20:22,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:20:22,477 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 902 transitions. [2025-01-09 11:20:22,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 11:20:22,477 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 902 transitions. [2025-01-09 11:20:22,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 11:20:22,498 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:20:22,499 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:22,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 11:20:22,499 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:20:22,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:20:22,501 INFO L85 PathProgramCache]: Analyzing trace with hash -830142966, now seen corresponding path program 1 times [2025-01-09 11:20:22,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:20:22,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374415999] [2025-01-09 11:20:22,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:20:22,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:20:22,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 11:20:22,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 11:20:22,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:20:22,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:20:24,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 11:20:24,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:20:24,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374415999] [2025-01-09 11:20:24,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374415999] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:20:24,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:20:24,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 11:20:24,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275028933] [2025-01-09 11:20:24,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:20:24,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 11:20:24,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:20:24,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 11:20:24,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-01-09 11:20:24,381 INFO L87 Difference]: Start difference. First operand 576 states and 902 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, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 11:20:25,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:20:25,694 INFO L93 Difference]: Finished difference Result 753 states and 1122 transitions. [2025-01-09 11:20:25,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 11:20:25,695 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, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2025-01-09 11:20:25,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:20:25,702 INFO L225 Difference]: With dead ends: 753 [2025-01-09 11:20:25,702 INFO L226 Difference]: Without dead ends: 751 [2025-01-09 11:20:25,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-01-09 11:20:25,707 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 336 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:20:25,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1177 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 11:20:25,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-01-09 11:20:25,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 647. [2025-01-09 11:20:25,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 439 states have (on average 1.3804100227790432) internal successors, (606), 444 states have internal predecessors, (606), 196 states have call successors, (196), 11 states have call predecessors, (196), 11 states have return successors, (196), 191 states have call predecessors, (196), 196 states have call successors, (196) [2025-01-09 11:20:25,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 998 transitions. [2025-01-09 11:20:25,787 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 998 transitions. Word has length 270 [2025-01-09 11:20:25,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:20:25,788 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 998 transitions. [2025-01-09 11:20:25,788 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, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 11:20:25,788 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 998 transitions. [2025-01-09 11:20:25,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 11:20:25,789 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:20:25,789 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:25,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 11:20:25,789 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:20:25,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:20:25,790 INFO L85 PathProgramCache]: Analyzing trace with hash -828295924, now seen corresponding path program 1 times [2025-01-09 11:20:25,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:20:25,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431536659] [2025-01-09 11:20:25,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:20:25,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:20:25,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 11:20:25,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 11:20:25,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:20:25,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:20:28,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 11:20:28,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:20:28,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431536659] [2025-01-09 11:20:28,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431536659] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:20:28,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:20:28,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 11:20:28,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836588094] [2025-01-09 11:20:28,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:20:28,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 11:20:28,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:20:28,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 11:20:28,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-01-09 11:20:28,539 INFO L87 Difference]: Start difference. First operand 647 states and 998 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 11:20:29,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:20:29,763 INFO L93 Difference]: Finished difference Result 751 states and 1120 transitions. [2025-01-09 11:20:29,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 11:20:29,763 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2025-01-09 11:20:29,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:20:29,767 INFO L225 Difference]: With dead ends: 751 [2025-01-09 11:20:29,767 INFO L226 Difference]: Without dead ends: 749 [2025-01-09 11:20:29,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-01-09 11:20:29,768 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 323 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 11:20:29,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 1348 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 11:20:29,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2025-01-09 11:20:29,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 647. [2025-01-09 11:20:29,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 439 states have (on average 1.3804100227790432) internal successors, (606), 444 states have internal predecessors, (606), 196 states have call successors, (196), 11 states have call predecessors, (196), 11 states have return successors, (196), 191 states have call predecessors, (196), 196 states have call successors, (196) [2025-01-09 11:20:29,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 998 transitions. [2025-01-09 11:20:29,809 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 998 transitions. Word has length 270 [2025-01-09 11:20:29,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:20:29,809 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 998 transitions. [2025-01-09 11:20:29,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 11:20:29,810 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 998 transitions. [2025-01-09 11:20:29,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 11:20:29,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:20:29,811 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:29,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 11:20:29,811 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:20:29,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:20:29,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1837718926, now seen corresponding path program 1 times [2025-01-09 11:20:29,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:20:29,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570489654] [2025-01-09 11:20:29,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:20:29,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:20:29,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 11:20:29,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 11:20:29,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:20:29,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:20:30,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 11:20:30,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:20:30,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570489654] [2025-01-09 11:20:30,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570489654] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:20:30,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:20:30,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:20:30,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244079240] [2025-01-09 11:20:30,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:20:30,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:20:30,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:20:30,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:20:30,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:20:30,064 INFO L87 Difference]: Start difference. First operand 647 states and 998 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-01-09 11:20:30,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:20:30,366 INFO L93 Difference]: Finished difference Result 1201 states and 1838 transitions. [2025-01-09 11:20:30,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:20:30,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 270 [2025-01-09 11:20:30,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:20:30,371 INFO L225 Difference]: With dead ends: 1201 [2025-01-09 11:20:30,371 INFO L226 Difference]: Without dead ends: 646 [2025-01-09 11:20:30,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:20:30,373 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 220 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:20:30,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 305 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:20:30,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2025-01-09 11:20:30,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 631. [2025-01-09 11:20:30,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 417 states have (on average 1.3429256594724222) internal successors, (560), 422 states have internal predecessors, (560), 200 states have call successors, (200), 13 states have call predecessors, (200), 13 states have return successors, (200), 195 states have call predecessors, (200), 200 states have call successors, (200) [2025-01-09 11:20:30,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 960 transitions. [2025-01-09 11:20:30,417 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 960 transitions. Word has length 270 [2025-01-09 11:20:30,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:20:30,418 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 960 transitions. [2025-01-09 11:20:30,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-01-09 11:20:30,418 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 960 transitions. [2025-01-09 11:20:30,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-01-09 11:20:30,420 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:20:30,420 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:30,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 11:20:30,420 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:20:30,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:20:30,421 INFO L85 PathProgramCache]: Analyzing trace with hash 954778060, now seen corresponding path program 1 times [2025-01-09 11:20:30,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:20:30,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143251267] [2025-01-09 11:20:30,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:20:30,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:20:30,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 11:20:30,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 11:20:30,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:20:30,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:20:49,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 11:20:49,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:20:49,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143251267] [2025-01-09 11:20:49,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143251267] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:20:49,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:20:49,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 11:20:49,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346799369] [2025-01-09 11:20:49,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:20:49,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 11:20:49,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:20:49,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 11:20:49,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-01-09 11:20:49,487 INFO L87 Difference]: Start difference. First operand 631 states and 960 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 11:20:51,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:20:51,994 INFO L93 Difference]: Finished difference Result 981 states and 1442 transitions. [2025-01-09 11:20:51,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 11:20:51,995 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 271 [2025-01-09 11:20:51,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:20:52,000 INFO L225 Difference]: With dead ends: 981 [2025-01-09 11:20:52,000 INFO L226 Difference]: Without dead ends: 979 [2025-01-09 11:20:52,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=221, Invalid=535, Unknown=0, NotChecked=0, Total=756 [2025-01-09 11:20:52,001 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 728 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 11:20:52,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1266 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 11:20:52,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2025-01-09 11:20:52,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 668. [2025-01-09 11:20:52,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 456 states have (on average 1.3771929824561404) internal successors, (628), 460 states have internal predecessors, (628), 196 states have call successors, (196), 15 states have call predecessors, (196), 15 states have return successors, (196), 192 states have call predecessors, (196), 196 states have call successors, (196) [2025-01-09 11:20:52,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 1020 transitions. [2025-01-09 11:20:52,062 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 1020 transitions. Word has length 271 [2025-01-09 11:20:52,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:20:52,062 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 1020 transitions. [2025-01-09 11:20:52,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 11:20:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 1020 transitions. [2025-01-09 11:20:52,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-01-09 11:20:52,063 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:20:52,064 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:52,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 11:20:52,064 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:20:52,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:20:52,065 INFO L85 PathProgramCache]: Analyzing trace with hash 956625102, now seen corresponding path program 1 times [2025-01-09 11:20:52,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:20:52,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56417337] [2025-01-09 11:20:52,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:20:52,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:20:52,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 11:20:52,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 11:20:52,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:20:52,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:20:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 11:20:56,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:20:56,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56417337] [2025-01-09 11:20:56,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56417337] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:20:56,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:20:56,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 11:20:56,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50080432] [2025-01-09 11:20:56,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:20:56,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 11:20:56,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:20:56,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 11:20:56,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-01-09 11:20:56,744 INFO L87 Difference]: Start difference. First operand 668 states and 1020 transitions. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 11:20:57,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:20:57,887 INFO L93 Difference]: Finished difference Result 876 states and 1306 transitions. [2025-01-09 11:20:57,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 11:20:57,887 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 271 [2025-01-09 11:20:57,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:20:57,891 INFO L225 Difference]: With dead ends: 876 [2025-01-09 11:20:57,892 INFO L226 Difference]: Without dead ends: 874 [2025-01-09 11:20:57,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2025-01-09 11:20:57,893 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 392 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 11:20:57,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 1766 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 11:20:57,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-01-09 11:20:57,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 672. [2025-01-09 11:20:57,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 460 states have (on average 1.3782608695652174) internal successors, (634), 464 states have internal predecessors, (634), 196 states have call successors, (196), 15 states have call predecessors, (196), 15 states have return successors, (196), 192 states have call predecessors, (196), 196 states have call successors, (196) [2025-01-09 11:20:57,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1026 transitions. [2025-01-09 11:20:57,947 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1026 transitions. Word has length 271 [2025-01-09 11:20:57,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:20:57,948 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 1026 transitions. [2025-01-09 11:20:57,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 11:20:57,949 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1026 transitions. [2025-01-09 11:20:57,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-01-09 11:20:57,950 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:20:57,950 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:57,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 11:20:57,950 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:20:57,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:20:57,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1212943498, now seen corresponding path program 1 times [2025-01-09 11:20:57,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:20:57,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365897320] [2025-01-09 11:20:57,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:20:57,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:20:57,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 11:20:57,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 11:20:57,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:20:57,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:21:01,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 11:21:01,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:21:01,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365897320] [2025-01-09 11:21:01,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365897320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:21:01,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:21:01,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 11:21:01,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216060933] [2025-01-09 11:21:01,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:21:01,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 11:21:01,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:21:01,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 11:21:01,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-01-09 11:21:01,060 INFO L87 Difference]: Start difference. First operand 672 states and 1026 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 11:21:01,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:21:01,827 INFO L93 Difference]: Finished difference Result 882 states and 1314 transitions. [2025-01-09 11:21:01,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 11:21:01,828 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 271 [2025-01-09 11:21:01,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:21:01,832 INFO L225 Difference]: With dead ends: 882 [2025-01-09 11:21:01,832 INFO L226 Difference]: Without dead ends: 880 [2025-01-09 11:21:01,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2025-01-09 11:21:01,833 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 510 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 11:21:01,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 1211 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 11:21:01,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-01-09 11:21:01,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 676. [2025-01-09 11:21:01,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 464 states have (on average 1.3814655172413792) internal successors, (641), 468 states have internal predecessors, (641), 196 states have call successors, (196), 15 states have call predecessors, (196), 15 states have return successors, (196), 192 states have call predecessors, (196), 196 states have call successors, (196) [2025-01-09 11:21:01,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 1033 transitions. [2025-01-09 11:21:01,883 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 1033 transitions. Word has length 271 [2025-01-09 11:21:01,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:21:01,883 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 1033 transitions. [2025-01-09 11:21:01,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 11:21:01,884 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 1033 transitions. [2025-01-09 11:21:01,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-01-09 11:21:01,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:21:01,885 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:01,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 11:21:01,885 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:21:01,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:21:01,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1214790540, now seen corresponding path program 1 times [2025-01-09 11:21:01,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:21:01,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936571582] [2025-01-09 11:21:01,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:21:01,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:21:01,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 11:21:01,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 11:21:01,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:21:01,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:21:07,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 11:21:07,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:21:07,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936571582] [2025-01-09 11:21:07,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936571582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:21:07,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:21:07,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 11:21:07,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640257705] [2025-01-09 11:21:07,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:21:07,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 11:21:07,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:21:07,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 11:21:07,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-01-09 11:21:07,643 INFO L87 Difference]: Start difference. First operand 676 states and 1033 transitions. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 11:21:08,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:21:08,930 INFO L93 Difference]: Finished difference Result 880 states and 1312 transitions. [2025-01-09 11:21:08,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 11:21:08,933 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 271 [2025-01-09 11:21:08,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:21:08,936 INFO L225 Difference]: With dead ends: 880 [2025-01-09 11:21:08,936 INFO L226 Difference]: Without dead ends: 878 [2025-01-09 11:21:08,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2025-01-09 11:21:08,937 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 461 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 11:21:08,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 1288 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 11:21:08,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2025-01-09 11:21:08,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 676. [2025-01-09 11:21:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 464 states have (on average 1.3814655172413792) internal successors, (641), 468 states have internal predecessors, (641), 196 states have call successors, (196), 15 states have call predecessors, (196), 15 states have return successors, (196), 192 states have call predecessors, (196), 196 states have call successors, (196) [2025-01-09 11:21:08,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 1033 transitions. [2025-01-09 11:21:08,986 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 1033 transitions. Word has length 271 [2025-01-09 11:21:08,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:21:08,987 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 1033 transitions. [2025-01-09 11:21:08,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 11:21:08,987 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 1033 transitions. [2025-01-09 11:21:08,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-01-09 11:21:08,988 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:21:08,988 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:08,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 11:21:08,988 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:21:08,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:21:08,989 INFO L85 PathProgramCache]: Analyzing trace with hash 892939722, now seen corresponding path program 1 times [2025-01-09 11:21:08,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:21:08,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824905337] [2025-01-09 11:21:08,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:21:08,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:21:08,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 11:21:09,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 11:21:09,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:21:09,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:21:09,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 11:21:09,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:21:09,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824905337] [2025-01-09 11:21:09,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824905337] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:21:09,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:21:09,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:21:09,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033791488] [2025-01-09 11:21:09,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:21:09,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:21:09,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:21:09,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:21:09,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:21:09,062 INFO L87 Difference]: Start difference. First operand 676 states and 1033 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 11:21:09,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:21:09,280 INFO L93 Difference]: Finished difference Result 1296 states and 1974 transitions. [2025-01-09 11:21:09,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:21:09,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 271 [2025-01-09 11:21:09,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:21:09,287 INFO L225 Difference]: With dead ends: 1296 [2025-01-09 11:21:09,287 INFO L226 Difference]: Without dead ends: 712 [2025-01-09 11:21:09,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:21:09,292 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 151 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:21:09,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 608 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:21:09,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2025-01-09 11:21:09,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 672. [2025-01-09 11:21:09,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 460 states have (on average 1.3782608695652174) internal successors, (634), 464 states have internal predecessors, (634), 196 states have call successors, (196), 15 states have call predecessors, (196), 15 states have return successors, (196), 192 states have call predecessors, (196), 196 states have call successors, (196) [2025-01-09 11:21:09,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1026 transitions. [2025-01-09 11:21:09,337 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1026 transitions. Word has length 271 [2025-01-09 11:21:09,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:21:09,337 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 1026 transitions. [2025-01-09 11:21:09,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 11:21:09,338 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1026 transitions. [2025-01-09 11:21:09,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-01-09 11:21:09,339 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:21:09,339 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:09,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 11:21:09,339 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:21:09,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:21:09,339 INFO L85 PathProgramCache]: Analyzing trace with hash -734165682, now seen corresponding path program 1 times [2025-01-09 11:21:09,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:21:09,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591138889] [2025-01-09 11:21:09,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:21:09,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:21:09,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 11:21:09,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 11:21:09,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:21:09,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:21:12,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 11:21:12,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:21:12,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591138889] [2025-01-09 11:21:12,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591138889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:21:12,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:21:12,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 11:21:12,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757698820] [2025-01-09 11:21:12,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:21:12,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 11:21:12,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:21:12,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 11:21:12,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-01-09 11:21:12,528 INFO L87 Difference]: Start difference. First operand 672 states and 1026 transitions. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-01-09 11:21:14,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:21:14,167 INFO L93 Difference]: Finished difference Result 885 states and 1317 transitions. [2025-01-09 11:21:14,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 11:21:14,168 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 271 [2025-01-09 11:21:14,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:21:14,172 INFO L225 Difference]: With dead ends: 885 [2025-01-09 11:21:14,172 INFO L226 Difference]: Without dead ends: 883 [2025-01-09 11:21:14,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=227, Invalid=643, Unknown=0, NotChecked=0, Total=870 [2025-01-09 11:21:14,173 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 464 mSDsluCounter, 1233 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 11:21:14,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 1481 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 11:21:14,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2025-01-09 11:21:14,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 686. [2025-01-09 11:21:14,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 474 states have (on average 1.3881856540084387) internal successors, (658), 478 states have internal predecessors, (658), 196 states have call successors, (196), 15 states have call predecessors, (196), 15 states have return successors, (196), 192 states have call predecessors, (196), 196 states have call successors, (196) [2025-01-09 11:21:14,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1050 transitions. [2025-01-09 11:21:14,224 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1050 transitions. Word has length 271 [2025-01-09 11:21:14,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:21:14,225 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 1050 transitions. [2025-01-09 11:21:14,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-01-09 11:21:14,225 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1050 transitions. [2025-01-09 11:21:14,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-01-09 11:21:14,226 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:21:14,227 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:14,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 11:21:14,227 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:21:14,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:21:14,227 INFO L85 PathProgramCache]: Analyzing trace with hash -732318640, now seen corresponding path program 1 times [2025-01-09 11:21:14,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:21:14,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929380483] [2025-01-09 11:21:14,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:21:14,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:21:14,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 11:21:14,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 11:21:14,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:21:14,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat