./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-90.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya --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 d7249a4084734468a9df38189de6441ee3548af581a8047a10bfcd263bdf18bd --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:11:16,460 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:11:16,523 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 05:11:16,527 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:11:16,528 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:11:16,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:11:16,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:11:16,552 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:11:16,553 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:11:16,553 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:11:16,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:11:16,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:11:16,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:11:16,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:11:16,556 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:11:16,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:11:16,557 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:11:16,557 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:11:16,558 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:11:16,558 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:11:16,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:11:16,560 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:11:16,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:11:16,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:11:16,561 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:11:16,562 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:11:16,562 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:11:16,563 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:11:16,563 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:11:16,563 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:11:16,564 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:11:16,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:11:16,564 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:11:16,565 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:11:16,565 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:11:16,565 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:11:16,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:11:16,566 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:11:16,566 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:11:16,566 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:11:16,566 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:11:16,567 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:11:16,567 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya 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 -> d7249a4084734468a9df38189de6441ee3548af581a8047a10bfcd263bdf18bd [2023-11-29 05:11:16,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:11:16,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:11:16,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:11:16,826 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:11:16,826 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:11:16,827 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-90.i [2023-11-29 05:11:19,541 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:11:19,741 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:11:19,741 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-90.i [2023-11-29 05:11:19,751 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/data/5ec8062b9/261f9679270243d3aa76525d754e25b2/FLAGfbdb8ead9 [2023-11-29 05:11:19,766 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/data/5ec8062b9/261f9679270243d3aa76525d754e25b2 [2023-11-29 05:11:19,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:11:19,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:11:19,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:11:19,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:11:19,778 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:11:19,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:11:19" (1/1) ... [2023-11-29 05:11:19,780 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b29735d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:19, skipping insertion in model container [2023-11-29 05:11:19,780 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:11:19" (1/1) ... [2023-11-29 05:11:19,813 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:11:19,956 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-90.i[917,930] [2023-11-29 05:11:20,008 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:11:20,021 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:11:20,031 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-90.i[917,930] [2023-11-29 05:11:20,067 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:11:20,084 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:11:20,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:20 WrapperNode [2023-11-29 05:11:20,085 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:11:20,086 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:11:20,086 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:11:20,086 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:11:20,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:20" (1/1) ... [2023-11-29 05:11:20,108 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:20" (1/1) ... [2023-11-29 05:11:20,147 INFO L138 Inliner]: procedures = 26, calls = 165, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 428 [2023-11-29 05:11:20,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:11:20,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:11:20,148 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:11:20,148 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:11:20,160 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:20" (1/1) ... [2023-11-29 05:11:20,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:20" (1/1) ... [2023-11-29 05:11:20,165 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:20" (1/1) ... [2023-11-29 05:11:20,182 INFO L175 MemorySlicer]: Split 130 memory accesses to 5 slices as follows [2, 34, 4, 55, 35]. 42 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 1, 6, 3]. The 19 writes are split as follows [0, 6, 1, 6, 6]. [2023-11-29 05:11:20,182 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:20" (1/1) ... [2023-11-29 05:11:20,182 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:20" (1/1) ... [2023-11-29 05:11:20,195 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:20" (1/1) ... [2023-11-29 05:11:20,199 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:20" (1/1) ... [2023-11-29 05:11:20,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:20" (1/1) ... [2023-11-29 05:11:20,203 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:20" (1/1) ... [2023-11-29 05:11:20,207 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:11:20,207 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:11:20,207 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:11:20,208 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:11:20,208 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:20" (1/1) ... [2023-11-29 05:11:20,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:11:20,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:11:20,236 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:11:20,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:11:20,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:11:20,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 05:11:20,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 05:11:20,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 05:11:20,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 05:11:20,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 05:11:20,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 05:11:20,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 05:11:20,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 05:11:20,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 05:11:20,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 05:11:20,271 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 05:11:20,271 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 05:11:20,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:11:20,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 05:11:20,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 05:11:20,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 05:11:20,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 05:11:20,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:11:20,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:11:20,410 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:11:20,412 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:11:20,857 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:11:20,899 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:11:20,899 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 05:11:20,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:11:20 BoogieIcfgContainer [2023-11-29 05:11:20,900 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:11:20,903 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:11:20,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:11:20,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:11:20,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:11:19" (1/3) ... [2023-11-29 05:11:20,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a85fe8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:11:20, skipping insertion in model container [2023-11-29 05:11:20,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:20" (2/3) ... [2023-11-29 05:11:20,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a85fe8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:11:20, skipping insertion in model container [2023-11-29 05:11:20,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:11:20" (3/3) ... [2023-11-29 05:11:20,910 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-90.i [2023-11-29 05:11:20,932 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:11:20,932 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:11:20,980 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:11:20,986 INFO L357 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, mHoare=true, 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;@13a8cb64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:11:20,986 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:11:20,990 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 82 states have internal predecessors, (114), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 05:11:21,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-29 05:11:21,006 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:21,007 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:11:21,008 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:21,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:21,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1081033117, now seen corresponding path program 1 times [2023-11-29 05:11:21,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:21,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572816303] [2023-11-29 05:11:21,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:21,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:11:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:11:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:11:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:11:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:11:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:11:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:11:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:11:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:11:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:11:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:11:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:11:21,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:11:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:11:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:11:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:11:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:11:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:11:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:11:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:11:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,428 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:11:21,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:21,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572816303] [2023-11-29 05:11:21,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572816303] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:11:21,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:11:21,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:11:21,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202770637] [2023-11-29 05:11:21,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:11:21,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 05:11:21,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:21,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 05:11:21,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:11:21,470 INFO L87 Difference]: Start difference. First operand has 104 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 82 states have internal predecessors, (114), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:11:21,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:21,517 INFO L93 Difference]: Finished difference Result 205 states and 326 transitions. [2023-11-29 05:11:21,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 05:11:21,520 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 148 [2023-11-29 05:11:21,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:21,528 INFO L225 Difference]: With dead ends: 205 [2023-11-29 05:11:21,529 INFO L226 Difference]: Without dead ends: 102 [2023-11-29 05:11:21,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:11:21,537 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:21,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:11:21,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-29 05:11:21,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-29 05:11:21,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 05:11:21,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 149 transitions. [2023-11-29 05:11:21,582 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 149 transitions. Word has length 148 [2023-11-29 05:11:21,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:21,583 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 149 transitions. [2023-11-29 05:11:21,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:11:21,584 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 149 transitions. [2023-11-29 05:11:21,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-29 05:11:21,588 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:21,588 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:11:21,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:11:21,589 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:21,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:21,589 INFO L85 PathProgramCache]: Analyzing trace with hash 363461691, now seen corresponding path program 1 times [2023-11-29 05:11:21,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:21,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130746202] [2023-11-29 05:11:21,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:21,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:11:21,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:11:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:11:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:11:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:11:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:11:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:11:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:11:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:11:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:11:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:11:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:11:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:11:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:11:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:11:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:11:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:11:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:21,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:11:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:11:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:11:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,010 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:11:22,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:22,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130746202] [2023-11-29 05:11:22,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130746202] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:11:22,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:11:22,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:11:22,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278620907] [2023-11-29 05:11:22,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:11:22,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:11:22,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:22,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:11:22,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:11:22,015 INFO L87 Difference]: Start difference. First operand 102 states and 149 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:11:22,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:22,087 INFO L93 Difference]: Finished difference Result 231 states and 339 transitions. [2023-11-29 05:11:22,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:11:22,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2023-11-29 05:11:22,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:22,091 INFO L225 Difference]: With dead ends: 231 [2023-11-29 05:11:22,091 INFO L226 Difference]: Without dead ends: 130 [2023-11-29 05:11:22,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:11:22,094 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 61 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:22,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 466 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:11:22,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-29 05:11:22,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 104. [2023-11-29 05:11:22,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 05:11:22,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 151 transitions. [2023-11-29 05:11:22,113 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 151 transitions. Word has length 148 [2023-11-29 05:11:22,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:22,115 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 151 transitions. [2023-11-29 05:11:22,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:11:22,116 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 151 transitions. [2023-11-29 05:11:22,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-29 05:11:22,119 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:22,119 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:11:22,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:11:22,120 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:22,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:22,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1744348064, now seen corresponding path program 1 times [2023-11-29 05:11:22,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:22,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253183851] [2023-11-29 05:11:22,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:22,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:11:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:11:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:11:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:11:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:11:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:11:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:11:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:11:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:11:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:11:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:11:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:11:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:11:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:11:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:11:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:11:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:11:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:11:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:11:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:11:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:22,542 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:11:22,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:22,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253183851] [2023-11-29 05:11:22,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253183851] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:11:22,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:11:22,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:11:22,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213151654] [2023-11-29 05:11:22,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:11:22,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:11:22,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:22,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:11:22,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:11:22,546 INFO L87 Difference]: Start difference. First operand 104 states and 151 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:11:22,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:22,660 INFO L93 Difference]: Finished difference Result 253 states and 366 transitions. [2023-11-29 05:11:22,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:11:22,661 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2023-11-29 05:11:22,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:22,664 INFO L225 Difference]: With dead ends: 253 [2023-11-29 05:11:22,664 INFO L226 Difference]: Without dead ends: 150 [2023-11-29 05:11:22,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:11:22,667 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 58 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:22,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 679 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:11:22,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-11-29 05:11:22,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 109. [2023-11-29 05:11:22,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 87 states have internal predecessors, (117), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 05:11:22,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2023-11-29 05:11:22,683 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 150 [2023-11-29 05:11:22,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:22,684 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2023-11-29 05:11:22,684 INFO L496 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:11:22,684 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2023-11-29 05:11:22,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-29 05:11:22,687 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:22,687 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:11:22,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:11:22,688 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:22,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:22,689 INFO L85 PathProgramCache]: Analyzing trace with hash -2127917406, now seen corresponding path program 1 times [2023-11-29 05:11:22,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:22,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225616962] [2023-11-29 05:11:22,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:22,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:23,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:11:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:23,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:11:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:23,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:11:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:23,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:11:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:23,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:11:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:23,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:11:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:23,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:11:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:23,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:11:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:23,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:11:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:23,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:11:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:23,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:11:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:23,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:11:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:23,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:11:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:23,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:11:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:23,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:11:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:23,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:11:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:23,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:11:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:23,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:11:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:23,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:11:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:23,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:11:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:11:23,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:23,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225616962] [2023-11-29 05:11:23,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225616962] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:11:23,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:11:23,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:11:23,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170350583] [2023-11-29 05:11:23,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:11:23,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:11:23,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:23,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:11:23,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:11:23,333 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:11:23,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:23,487 INFO L93 Difference]: Finished difference Result 252 states and 362 transitions. [2023-11-29 05:11:23,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:11:23,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2023-11-29 05:11:23,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:23,491 INFO L225 Difference]: With dead ends: 252 [2023-11-29 05:11:23,491 INFO L226 Difference]: Without dead ends: 144 [2023-11-29 05:11:23,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:11:23,493 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 193 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:23,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 512 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:11:23,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-11-29 05:11:23,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 111. [2023-11-29 05:11:23,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 89 states have (on average 1.3370786516853932) internal successors, (119), 89 states have internal predecessors, (119), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 05:11:23,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2023-11-29 05:11:23,507 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 150 [2023-11-29 05:11:23,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:23,508 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2023-11-29 05:11:23,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:11:23,509 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2023-11-29 05:11:23,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-29 05:11:23,511 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:23,511 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:11:23,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:11:23,512 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:23,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:23,512 INFO L85 PathProgramCache]: Analyzing trace with hash 213927120, now seen corresponding path program 1 times [2023-11-29 05:11:23,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:23,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863513297] [2023-11-29 05:11:23,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:23,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:25,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:11:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:25,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:11:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:25,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:11:25,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:25,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:11:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:25,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:11:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:25,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:11:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:25,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:11:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:25,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:11:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:25,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:11:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:25,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:11:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:25,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:11:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:25,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:11:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:25,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:11:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:25,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:11:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:25,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:11:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:25,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:11:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:25,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:11:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:25,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:11:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:25,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:11:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:25,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:11:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:25,200 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:11:25,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:25,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863513297] [2023-11-29 05:11:25,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863513297] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:11:25,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:11:25,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:11:25,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31315553] [2023-11-29 05:11:25,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:11:25,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:11:25,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:25,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:11:25,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:11:25,203 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-29 05:11:25,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:25,907 INFO L93 Difference]: Finished difference Result 245 states and 349 transitions. [2023-11-29 05:11:25,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:11:25,908 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 151 [2023-11-29 05:11:25,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:25,910 INFO L225 Difference]: With dead ends: 245 [2023-11-29 05:11:25,910 INFO L226 Difference]: Without dead ends: 135 [2023-11-29 05:11:25,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:11:25,913 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 281 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:25,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 693 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:11:25,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-29 05:11:25,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 118. [2023-11-29 05:11:25,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 95 states have (on average 1.3157894736842106) internal successors, (125), 95 states have internal predecessors, (125), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 05:11:25,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 165 transitions. [2023-11-29 05:11:25,949 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 165 transitions. Word has length 151 [2023-11-29 05:11:25,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:25,950 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 165 transitions. [2023-11-29 05:11:25,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-29 05:11:25,951 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 165 transitions. [2023-11-29 05:11:25,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-29 05:11:25,953 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:25,954 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:11:25,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:11:25,954 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:25,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:25,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1885677381, now seen corresponding path program 1 times [2023-11-29 05:11:25,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:25,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676267560] [2023-11-29 05:11:25,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:25,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:26,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:11:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:26,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:11:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:26,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:11:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:27,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:11:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:27,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:11:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:27,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:11:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:27,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:11:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:27,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:11:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:27,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:11:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:27,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:11:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:27,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:11:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:27,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:11:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:27,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:11:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:27,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:11:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:27,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:11:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:27,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:11:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:27,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:11:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:27,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:11:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:27,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:11:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:27,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:11:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:27,091 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-11-29 05:11:27,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:27,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676267560] [2023-11-29 05:11:27,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676267560] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:11:27,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19636234] [2023-11-29 05:11:27,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:27,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:11:27,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:11:27,096 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:11:27,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:11:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:27,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 05:11:27,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:11:27,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 05:11:27,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 05:11:27,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 05:11:28,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2023-11-29 05:11:28,499 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 33 proven. 345 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2023-11-29 05:11:28,499 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:11:28,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19636234] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:11:28,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:11:28,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2023-11-29 05:11:28,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199514964] [2023-11-29 05:11:28,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:11:28,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 05:11:28,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:28,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 05:11:28,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:11:28,731 INFO L87 Difference]: Start difference. First operand 118 states and 165 transitions. Second operand has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 12 states have internal predecessors, (92), 5 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 4 states have call predecessors, (40), 5 states have call successors, (40) [2023-11-29 05:11:29,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:29,243 INFO L93 Difference]: Finished difference Result 245 states and 339 transitions. [2023-11-29 05:11:29,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 05:11:29,244 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 12 states have internal predecessors, (92), 5 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 4 states have call predecessors, (40), 5 states have call successors, (40) Word has length 152 [2023-11-29 05:11:29,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:29,246 INFO L225 Difference]: With dead ends: 245 [2023-11-29 05:11:29,246 INFO L226 Difference]: Without dead ends: 128 [2023-11-29 05:11:29,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 303 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2023-11-29 05:11:29,248 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 171 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:29,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 693 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:11:29,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-29 05:11:29,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 121. [2023-11-29 05:11:29,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 95 states have (on average 1.2947368421052632) internal successors, (123), 96 states have internal predecessors, (123), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 05:11:29,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 167 transitions. [2023-11-29 05:11:29,283 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 167 transitions. Word has length 152 [2023-11-29 05:11:29,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:29,284 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 167 transitions. [2023-11-29 05:11:29,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 12 states have internal predecessors, (92), 5 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 4 states have call predecessors, (40), 5 states have call successors, (40) [2023-11-29 05:11:29,284 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 167 transitions. [2023-11-29 05:11:29,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-29 05:11:29,286 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:29,287 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:11:29,296 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:11:29,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:11:29,488 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:29,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:29,488 INFO L85 PathProgramCache]: Analyzing trace with hash 80239047, now seen corresponding path program 1 times [2023-11-29 05:11:29,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:29,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282919492] [2023-11-29 05:11:29,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:29,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:11:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:11:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:11:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:11:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:11:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:11:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:11:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:11:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:11:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:11:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:11:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:11:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:11:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:11:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:11:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:11:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:11:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:11:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:11:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:11:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,696 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-11-29 05:11:30,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:30,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282919492] [2023-11-29 05:11:30,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282919492] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:11:30,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932707617] [2023-11-29 05:11:30,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:30,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:11:30,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:11:30,698 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:11:30,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 05:11:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:30,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-29 05:11:30,925 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:11:32,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 05:11:33,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 05:11:33,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:11:33,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:11:33,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2023-11-29 05:11:33,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:11:33,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:11:33,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:11:33,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 20 [2023-11-29 05:11:33,647 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 52 proven. 147 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-11-29 05:11:33,647 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:11:34,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932707617] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:11:34,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:11:34,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 23 [2023-11-29 05:11:34,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552665094] [2023-11-29 05:11:34,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:11:34,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 05:11:34,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:34,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 05:11:34,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=832, Unknown=0, NotChecked=0, Total=930 [2023-11-29 05:11:34,333 INFO L87 Difference]: Start difference. First operand 121 states and 167 transitions. Second operand has 23 states, 20 states have (on average 5.25) internal successors, (105), 21 states have internal predecessors, (105), 8 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 6 states have call predecessors, (40), 8 states have call successors, (40) [2023-11-29 05:11:37,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:37,319 INFO L93 Difference]: Finished difference Result 303 states and 404 transitions. [2023-11-29 05:11:37,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-29 05:11:37,321 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 5.25) internal successors, (105), 21 states have internal predecessors, (105), 8 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 6 states have call predecessors, (40), 8 states have call successors, (40) Word has length 152 [2023-11-29 05:11:37,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:37,324 INFO L225 Difference]: With dead ends: 303 [2023-11-29 05:11:37,324 INFO L226 Difference]: Without dead ends: 187 [2023-11-29 05:11:37,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=648, Invalid=2774, Unknown=0, NotChecked=0, Total=3422 [2023-11-29 05:11:37,327 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 874 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:37,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 1097 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 05:11:37,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-11-29 05:11:37,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 133. [2023-11-29 05:11:37,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 106 states have (on average 1.2641509433962264) internal successors, (134), 106 states have internal predecessors, (134), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 05:11:37,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 174 transitions. [2023-11-29 05:11:37,366 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 174 transitions. Word has length 152 [2023-11-29 05:11:37,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:37,367 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 174 transitions. [2023-11-29 05:11:37,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 5.25) internal successors, (105), 21 states have internal predecessors, (105), 8 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 6 states have call predecessors, (40), 8 states have call successors, (40) [2023-11-29 05:11:37,367 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 174 transitions. [2023-11-29 05:11:37,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-29 05:11:37,369 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:37,369 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:11:37,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 05:11:37,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:11:37,570 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:37,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:37,571 INFO L85 PathProgramCache]: Analyzing trace with hash 392104301, now seen corresponding path program 1 times [2023-11-29 05:11:37,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:37,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346539356] [2023-11-29 05:11:37,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:37,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:38,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:11:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:38,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:11:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:38,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:11:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:38,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:11:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:38,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:11:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:38,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:11:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:38,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:11:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:38,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:11:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:38,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:11:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:38,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:11:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:38,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:11:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:38,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:11:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:38,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:11:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:38,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:11:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:38,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:11:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:38,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:11:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:38,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:11:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:38,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:11:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:38,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:11:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:38,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:11:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:38,726 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:11:38,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:38,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346539356] [2023-11-29 05:11:38,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346539356] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:11:38,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:11:38,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:11:38,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419676689] [2023-11-29 05:11:38,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:11:38,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:11:38,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:38,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:11:38,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:11:38,729 INFO L87 Difference]: Start difference. First operand 133 states and 174 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:11:40,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:40,679 INFO L93 Difference]: Finished difference Result 426 states and 569 transitions. [2023-11-29 05:11:40,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 05:11:40,680 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2023-11-29 05:11:40,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:40,682 INFO L225 Difference]: With dead ends: 426 [2023-11-29 05:11:40,682 INFO L226 Difference]: Without dead ends: 294 [2023-11-29 05:11:40,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2023-11-29 05:11:40,684 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 441 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:40,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1338 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 05:11:40,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2023-11-29 05:11:40,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 202. [2023-11-29 05:11:40,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 164 states have (on average 1.274390243902439) internal successors, (209), 165 states have internal predecessors, (209), 28 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-29 05:11:40,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 265 transitions. [2023-11-29 05:11:40,731 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 265 transitions. Word has length 153 [2023-11-29 05:11:40,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:40,731 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 265 transitions. [2023-11-29 05:11:40,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:11:40,732 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 265 transitions. [2023-11-29 05:11:40,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-29 05:11:40,733 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:40,733 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:11:40,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 05:11:40,733 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:40,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:40,734 INFO L85 PathProgramCache]: Analyzing trace with hash -194701713, now seen corresponding path program 1 times [2023-11-29 05:11:40,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:40,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144382921] [2023-11-29 05:11:40,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:40,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:41,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:11:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:41,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:11:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:41,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:11:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:41,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:11:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:41,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:11:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:41,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:11:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:41,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:11:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:41,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:11:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:41,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:11:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:41,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:11:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:41,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:11:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:41,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:11:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:41,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:11:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:41,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:11:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:41,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:11:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:41,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:11:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:41,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:11:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:41,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:11:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:41,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:11:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:41,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:11:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:41,424 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:11:41,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:41,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144382921] [2023-11-29 05:11:41,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144382921] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:11:41,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:11:41,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:11:41,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200287492] [2023-11-29 05:11:41,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:11:41,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:11:41,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:41,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:11:41,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:11:41,426 INFO L87 Difference]: Start difference. First operand 202 states and 265 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:11:41,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:41,920 INFO L93 Difference]: Finished difference Result 494 states and 650 transitions. [2023-11-29 05:11:41,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:11:41,921 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2023-11-29 05:11:41,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:41,924 INFO L225 Difference]: With dead ends: 494 [2023-11-29 05:11:41,924 INFO L226 Difference]: Without dead ends: 293 [2023-11-29 05:11:41,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:11:41,925 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 305 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:41,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 613 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:11:41,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2023-11-29 05:11:41,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 199. [2023-11-29 05:11:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 161 states have (on average 1.2670807453416149) internal successors, (204), 162 states have internal predecessors, (204), 28 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-29 05:11:41,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 260 transitions. [2023-11-29 05:11:41,986 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 260 transitions. Word has length 153 [2023-11-29 05:11:41,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:41,987 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 260 transitions. [2023-11-29 05:11:41,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:11:41,987 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 260 transitions. [2023-11-29 05:11:41,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-29 05:11:41,989 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:41,989 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:11:41,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:11:41,989 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:41,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:41,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1196243601, now seen corresponding path program 1 times [2023-11-29 05:11:41,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:41,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953915818] [2023-11-29 05:11:41,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:41,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:42,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:11:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:42,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:11:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:42,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:11:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:42,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:11:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:42,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:11:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:42,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:11:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:42,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:11:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:42,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:11:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:42,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:11:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:42,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:11:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:42,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:11:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:42,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:11:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:42,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:11:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:42,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:11:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:42,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:11:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:42,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:11:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:42,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:11:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:42,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:11:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:42,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:11:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:42,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:11:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:42,907 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:11:42,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:42,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953915818] [2023-11-29 05:11:42,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953915818] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:11:42,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:11:42,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:11:42,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335968985] [2023-11-29 05:11:42,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:11:42,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:11:42,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:42,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:11:42,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:11:42,909 INFO L87 Difference]: Start difference. First operand 199 states and 260 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:11:43,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:43,398 INFO L93 Difference]: Finished difference Result 490 states and 643 transitions. [2023-11-29 05:11:43,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:11:43,399 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2023-11-29 05:11:43,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:43,401 INFO L225 Difference]: With dead ends: 490 [2023-11-29 05:11:43,401 INFO L226 Difference]: Without dead ends: 292 [2023-11-29 05:11:43,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:11:43,402 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 327 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:43,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 553 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:11:43,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2023-11-29 05:11:43,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 199. [2023-11-29 05:11:43,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 161 states have (on average 1.2608695652173914) internal successors, (203), 162 states have internal predecessors, (203), 28 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-29 05:11:43,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 259 transitions. [2023-11-29 05:11:43,448 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 259 transitions. Word has length 153 [2023-11-29 05:11:43,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:43,448 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 259 transitions. [2023-11-29 05:11:43,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:11:43,448 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 259 transitions. [2023-11-29 05:11:43,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-29 05:11:43,450 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:43,450 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:11:43,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:11:43,451 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:43,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:43,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1783049615, now seen corresponding path program 1 times [2023-11-29 05:11:43,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:43,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794573589] [2023-11-29 05:11:43,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:43,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:48,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:11:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:48,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:11:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:48,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:11:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:48,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:11:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:48,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:11:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:48,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:11:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:48,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:11:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:48,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:11:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:48,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:11:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:48,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:11:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:48,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:11:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:48,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:11:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:48,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:11:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:48,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:11:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:48,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:11:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:48,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:11:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:48,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:11:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:48,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:11:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:48,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:11:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:49,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:11:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:49,017 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 69 proven. 39 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2023-11-29 05:11:49,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:49,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794573589] [2023-11-29 05:11:49,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794573589] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:11:49,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789384711] [2023-11-29 05:11:49,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:49,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:11:49,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:11:49,018 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:11:49,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 05:11:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:49,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-29 05:11:49,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:11:50,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 05:11:50,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:11:50,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2023-11-29 05:11:50,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:11:50,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 69 [2023-11-29 05:11:50,982 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-11-29 05:11:50,982 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:11:51,362 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:11:51,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789384711] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 05:11:51,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:11:51,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [30, 11] total 42 [2023-11-29 05:11:51,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772976297] [2023-11-29 05:11:51,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:11:51,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:11:51,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:51,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:11:51,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2023-11-29 05:11:51,365 INFO L87 Difference]: Start difference. First operand 199 states and 259 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:11:52,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:52,117 INFO L93 Difference]: Finished difference Result 521 states and 685 transitions. [2023-11-29 05:11:52,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 05:11:52,117 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2023-11-29 05:11:52,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:52,120 INFO L225 Difference]: With dead ends: 521 [2023-11-29 05:11:52,120 INFO L226 Difference]: Without dead ends: 323 [2023-11-29 05:11:52,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 333 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=167, Invalid=2185, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 05:11:52,122 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 220 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:52,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1246 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:11:52,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2023-11-29 05:11:52,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 196. [2023-11-29 05:11:52,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 158 states have (on average 1.259493670886076) internal successors, (199), 159 states have internal predecessors, (199), 28 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-29 05:11:52,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 255 transitions. [2023-11-29 05:11:52,172 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 255 transitions. Word has length 153 [2023-11-29 05:11:52,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:52,172 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 255 transitions. [2023-11-29 05:11:52,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:11:52,173 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 255 transitions. [2023-11-29 05:11:52,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-11-29 05:11:52,174 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:52,174 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:11:52,181 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 05:11:52,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:11:52,380 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:52,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:52,380 INFO L85 PathProgramCache]: Analyzing trace with hash -360052923, now seen corresponding path program 1 times [2023-11-29 05:11:52,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:52,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206914730] [2023-11-29 05:11:52,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:52,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:52,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:11:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:52,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:11:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:52,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:11:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:52,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:11:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:52,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:11:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:52,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:11:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:52,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:11:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:52,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:11:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:52,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:11:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:52,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:11:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:52,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:11:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:52,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:11:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:52,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:11:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:52,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:11:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:52,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:11:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:52,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:11:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:52,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:11:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:52,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:11:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:52,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:11:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:52,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:11:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:52,752 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:11:52,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:52,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206914730] [2023-11-29 05:11:52,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206914730] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:11:52,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:11:52,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:11:52,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578790499] [2023-11-29 05:11:52,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:11:52,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:11:52,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:52,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:11:52,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:11:52,753 INFO L87 Difference]: Start difference. First operand 196 states and 255 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:11:53,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:53,172 INFO L93 Difference]: Finished difference Result 526 states and 699 transitions. [2023-11-29 05:11:53,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:11:53,173 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2023-11-29 05:11:53,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:53,175 INFO L225 Difference]: With dead ends: 526 [2023-11-29 05:11:53,175 INFO L226 Difference]: Without dead ends: 331 [2023-11-29 05:11:53,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:11:53,177 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 290 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:53,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 567 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:11:53,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2023-11-29 05:11:53,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 221. [2023-11-29 05:11:53,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 183 states have (on average 1.2677595628415301) internal successors, (232), 184 states have internal predecessors, (232), 28 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-29 05:11:53,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 288 transitions. [2023-11-29 05:11:53,239 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 288 transitions. Word has length 154 [2023-11-29 05:11:53,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:53,240 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 288 transitions. [2023-11-29 05:11:53,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:11:53,240 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 288 transitions. [2023-11-29 05:11:53,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-11-29 05:11:53,242 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:53,242 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:11:53,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 05:11:53,242 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:53,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:53,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1371170173, now seen corresponding path program 1 times [2023-11-29 05:11:53,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:53,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882362057] [2023-11-29 05:11:53,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:53,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:53,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:11:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:53,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:11:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:53,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:11:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:53,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:11:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:53,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:11:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:53,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:11:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:53,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:11:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:53,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:11:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:53,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:11:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:53,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:11:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:53,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:11:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:53,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:11:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:53,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:11:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:53,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:11:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:53,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:11:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:53,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:11:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:53,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:11:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:53,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:11:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:53,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:11:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:53,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:11:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:53,850 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:11:53,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:53,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882362057] [2023-11-29 05:11:53,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882362057] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:11:53,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:11:53,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:11:53,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641660896] [2023-11-29 05:11:53,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:11:53,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:11:53,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:53,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:11:53,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:11:53,854 INFO L87 Difference]: Start difference. First operand 221 states and 288 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:11:54,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:54,316 INFO L93 Difference]: Finished difference Result 613 states and 803 transitions. [2023-11-29 05:11:54,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:11:54,316 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2023-11-29 05:11:54,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:54,319 INFO L225 Difference]: With dead ends: 613 [2023-11-29 05:11:54,319 INFO L226 Difference]: Without dead ends: 393 [2023-11-29 05:11:54,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:11:54,321 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 281 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:54,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 500 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:11:54,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2023-11-29 05:11:54,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 245. [2023-11-29 05:11:54,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 207 states have (on average 1.2705314009661837) internal successors, (263), 208 states have internal predecessors, (263), 28 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-29 05:11:54,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 319 transitions. [2023-11-29 05:11:54,372 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 319 transitions. Word has length 154 [2023-11-29 05:11:54,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:54,373 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 319 transitions. [2023-11-29 05:11:54,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:11:54,373 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 319 transitions. [2023-11-29 05:11:54,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-11-29 05:11:54,374 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:54,375 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:11:54,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 05:11:54,375 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:54,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:54,376 INFO L85 PathProgramCache]: Analyzing trace with hash -85293309, now seen corresponding path program 1 times [2023-11-29 05:11:54,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:54,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202770399] [2023-11-29 05:11:54,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:54,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:54,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:11:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:54,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:11:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:55,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:11:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:55,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:11:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:55,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:11:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:55,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:11:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:55,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:11:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:55,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:11:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:55,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:11:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:55,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:11:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:55,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:11:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:55,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:11:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:55,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:11:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:55,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:11:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:55,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:11:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:55,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:11:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:55,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:11:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:55,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:11:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:55,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:11:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:55,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:11:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:55,062 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:11:55,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:55,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202770399] [2023-11-29 05:11:55,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202770399] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:11:55,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:11:55,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:11:55,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388699237] [2023-11-29 05:11:55,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:11:55,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:11:55,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:55,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:11:55,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:11:55,064 INFO L87 Difference]: Start difference. First operand 245 states and 319 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-29 05:11:55,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:55,652 INFO L93 Difference]: Finished difference Result 527 states and 686 transitions. [2023-11-29 05:11:55,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:11:55,657 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 154 [2023-11-29 05:11:55,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:55,659 INFO L225 Difference]: With dead ends: 527 [2023-11-29 05:11:55,659 INFO L226 Difference]: Without dead ends: 283 [2023-11-29 05:11:55,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:11:55,661 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 495 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:55,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 653 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:11:55,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2023-11-29 05:11:55,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 191. [2023-11-29 05:11:55,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 163 states have (on average 1.2576687116564418) internal successors, (205), 163 states have internal predecessors, (205), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 05:11:55,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 245 transitions. [2023-11-29 05:11:55,717 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 245 transitions. Word has length 154 [2023-11-29 05:11:55,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:55,717 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 245 transitions. [2023-11-29 05:11:55,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-29 05:11:55,718 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 245 transitions. [2023-11-29 05:11:55,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-11-29 05:11:55,719 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:55,719 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:11:55,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 05:11:55,719 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:55,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:55,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1096410559, now seen corresponding path program 1 times [2023-11-29 05:11:55,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:55,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145951070] [2023-11-29 05:11:55,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:55,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:56,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:11:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:56,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:11:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:56,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:11:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:56,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:11:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:56,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:11:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:56,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:11:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:56,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:11:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:56,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:11:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:56,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:11:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:56,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:11:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:56,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:11:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:56,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:11:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:56,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:11:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:56,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:11:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:56,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:11:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:56,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:11:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:56,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:11:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:56,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:11:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:56,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:11:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:56,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:11:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:56,063 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:11:56,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:56,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145951070] [2023-11-29 05:11:56,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145951070] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:11:56,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:11:56,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:11:56,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881853873] [2023-11-29 05:11:56,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:11:56,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:11:56,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:56,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:11:56,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:11:56,064 INFO L87 Difference]: Start difference. First operand 191 states and 245 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:11:56,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:56,467 INFO L93 Difference]: Finished difference Result 452 states and 585 transitions. [2023-11-29 05:11:56,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:11:56,468 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 154 [2023-11-29 05:11:56,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:56,470 INFO L225 Difference]: With dead ends: 452 [2023-11-29 05:11:56,470 INFO L226 Difference]: Without dead ends: 262 [2023-11-29 05:11:56,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2023-11-29 05:11:56,471 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 386 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:56,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 643 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:11:56,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-11-29 05:11:56,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 213. [2023-11-29 05:11:56,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 185 states have (on average 1.2594594594594595) internal successors, (233), 185 states have internal predecessors, (233), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 05:11:56,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 273 transitions. [2023-11-29 05:11:56,523 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 273 transitions. Word has length 154 [2023-11-29 05:11:56,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:56,524 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 273 transitions. [2023-11-29 05:11:56,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:11:56,524 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 273 transitions. [2023-11-29 05:11:56,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-29 05:11:56,525 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:56,525 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:11:56,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 05:11:56,526 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:11:56,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:56,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1419982353, now seen corresponding path program 1 times [2023-11-29 05:11:56,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:56,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183336901] [2023-11-29 05:11:56,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:56,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:57,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:11:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:57,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:11:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:57,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:11:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:57,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:11:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:57,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:11:57,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:57,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:11:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:57,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:11:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:57,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:11:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:57,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:11:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:57,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:11:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:57,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:11:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:57,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:11:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:57,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:11:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:57,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:11:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:57,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:11:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:57,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:11:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:57,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:11:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:57,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:11:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:57,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:11:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:57,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:11:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:57,907 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:11:57,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:57,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183336901] [2023-11-29 05:11:57,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183336901] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:11:57,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:11:57,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-29 05:11:57,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630196338] [2023-11-29 05:11:57,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:11:57,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 05:11:57,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:57,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 05:11:57,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:11:57,910 INFO L87 Difference]: Start difference. First operand 213 states and 273 transitions. Second operand has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-29 05:12:01,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:01,280 INFO L93 Difference]: Finished difference Result 836 states and 1086 transitions. [2023-11-29 05:12:01,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 05:12:01,281 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 155 [2023-11-29 05:12:01,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:01,284 INFO L225 Difference]: With dead ends: 836 [2023-11-29 05:12:01,285 INFO L226 Difference]: Without dead ends: 624 [2023-11-29 05:12:01,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=356, Invalid=1050, Unknown=0, NotChecked=0, Total=1406 [2023-11-29 05:12:01,287 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 745 mSDsluCounter, 1742 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 1981 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:01,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 1981 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 05:12:01,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2023-11-29 05:12:01,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 494. [2023-11-29 05:12:01,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 439 states have (on average 1.2733485193621867) internal successors, (559), 439 states have internal predecessors, (559), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-29 05:12:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 639 transitions. [2023-11-29 05:12:01,400 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 639 transitions. Word has length 155 [2023-11-29 05:12:01,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:01,400 INFO L495 AbstractCegarLoop]: Abstraction has 494 states and 639 transitions. [2023-11-29 05:12:01,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-29 05:12:01,400 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 639 transitions. [2023-11-29 05:12:01,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-29 05:12:01,401 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:01,401 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:01,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 05:12:01,401 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:12:01,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:01,402 INFO L85 PathProgramCache]: Analyzing trace with hash 358675781, now seen corresponding path program 1 times [2023-11-29 05:12:01,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:01,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332924645] [2023-11-29 05:12:01,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:01,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:01,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:12:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:01,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:12:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:01,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:12:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:01,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:12:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:01,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:12:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:01,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:12:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:01,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:12:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:01,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:12:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:01,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:12:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:01,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:12:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:01,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:12:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:01,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:12:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:01,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:12:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:01,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:12:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:01,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:12:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:01,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:12:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:01,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:12:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:01,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:12:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:01,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:12:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:01,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:12:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:01,814 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:12:01,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:12:01,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332924645] [2023-11-29 05:12:01,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332924645] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:01,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:01,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:12:01,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595538070] [2023-11-29 05:12:01,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:01,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:12:01,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:12:01,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:12:01,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:12:01,816 INFO L87 Difference]: Start difference. First operand 494 states and 639 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:12:02,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:02,096 INFO L93 Difference]: Finished difference Result 1107 states and 1424 transitions. [2023-11-29 05:12:02,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:12:02,097 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2023-11-29 05:12:02,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:02,100 INFO L225 Difference]: With dead ends: 1107 [2023-11-29 05:12:02,100 INFO L226 Difference]: Without dead ends: 614 [2023-11-29 05:12:02,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:12:02,101 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 184 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:02,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 422 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:12:02,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2023-11-29 05:12:02,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 576. [2023-11-29 05:12:02,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 521 states have (on average 1.2533589251439539) internal successors, (653), 521 states have internal predecessors, (653), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-29 05:12:02,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 733 transitions. [2023-11-29 05:12:02,195 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 733 transitions. Word has length 156 [2023-11-29 05:12:02,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:02,195 INFO L495 AbstractCegarLoop]: Abstraction has 576 states and 733 transitions. [2023-11-29 05:12:02,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:12:02,195 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 733 transitions. [2023-11-29 05:12:02,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-29 05:12:02,196 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:02,197 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:02,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 05:12:02,197 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:12:02,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:02,197 INFO L85 PathProgramCache]: Analyzing trace with hash -34351229, now seen corresponding path program 1 times [2023-11-29 05:12:02,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:02,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674069679] [2023-11-29 05:12:02,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:02,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:03,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:12:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:03,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:12:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:03,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:12:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:03,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:12:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:03,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:12:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:03,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:12:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:03,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:12:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:03,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:12:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:03,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:12:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:03,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:12:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:03,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:12:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:03,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:12:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:03,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:12:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:03,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:12:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:03,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:12:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:03,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:12:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:03,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:12:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:03,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:12:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:03,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:12:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:03,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:12:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:03,447 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:12:03,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:12:03,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674069679] [2023-11-29 05:12:03,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674069679] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:03,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:03,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-29 05:12:03,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267593092] [2023-11-29 05:12:03,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:03,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 05:12:03,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:12:03,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 05:12:03,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-11-29 05:12:03,449 INFO L87 Difference]: Start difference. First operand 576 states and 733 transitions. Second operand has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2023-11-29 05:12:04,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:04,242 INFO L93 Difference]: Finished difference Result 1213 states and 1550 transitions. [2023-11-29 05:12:04,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 05:12:04,243 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 156 [2023-11-29 05:12:04,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:04,246 INFO L225 Difference]: With dead ends: 1213 [2023-11-29 05:12:04,246 INFO L226 Difference]: Without dead ends: 638 [2023-11-29 05:12:04,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2023-11-29 05:12:04,248 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 503 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:04,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1092 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:12:04,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2023-11-29 05:12:04,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 584. [2023-11-29 05:12:04,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 529 states have (on average 1.2495274102079394) internal successors, (661), 529 states have internal predecessors, (661), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-29 05:12:04,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 741 transitions. [2023-11-29 05:12:04,345 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 741 transitions. Word has length 156 [2023-11-29 05:12:04,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:04,345 INFO L495 AbstractCegarLoop]: Abstraction has 584 states and 741 transitions. [2023-11-29 05:12:04,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2023-11-29 05:12:04,345 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 741 transitions. [2023-11-29 05:12:04,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-29 05:12:04,346 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:04,346 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:04,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 05:12:04,347 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:12:04,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:04,347 INFO L85 PathProgramCache]: Analyzing trace with hash 207211356, now seen corresponding path program 1 times [2023-11-29 05:12:04,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:04,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546089407] [2023-11-29 05:12:04,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:04,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:04,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:12:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:04,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:12:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:04,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:12:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:04,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:12:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:04,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:12:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:04,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:12:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:04,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:12:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:04,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:12:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:04,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:12:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:04,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:12:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:04,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:12:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:04,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:12:04,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:04,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:12:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:04,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:12:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:04,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:12:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:04,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:12:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:04,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:12:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:04,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:12:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:04,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:12:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:04,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:12:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:12:04,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:12:04,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546089407] [2023-11-29 05:12:04,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546089407] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:04,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:04,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:12:04,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582247996] [2023-11-29 05:12:04,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:04,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:12:04,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:12:04,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:12:04,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:12:04,681 INFO L87 Difference]: Start difference. First operand 584 states and 741 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:12:04,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:04,960 INFO L93 Difference]: Finished difference Result 1239 states and 1582 transitions. [2023-11-29 05:12:04,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:12:04,960 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2023-11-29 05:12:04,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:04,963 INFO L225 Difference]: With dead ends: 1239 [2023-11-29 05:12:04,963 INFO L226 Difference]: Without dead ends: 656 [2023-11-29 05:12:04,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:12:04,965 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 231 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:04,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 485 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:12:04,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-29 05:12:05,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 584. [2023-11-29 05:12:05,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 529 states have (on average 1.2457466918714555) internal successors, (659), 529 states have internal predecessors, (659), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-29 05:12:05,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 739 transitions. [2023-11-29 05:12:05,053 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 739 transitions. Word has length 156 [2023-11-29 05:12:05,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:05,054 INFO L495 AbstractCegarLoop]: Abstraction has 584 states and 739 transitions. [2023-11-29 05:12:05,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:12:05,054 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 739 transitions. [2023-11-29 05:12:05,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-29 05:12:05,055 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:05,055 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:05,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 05:12:05,056 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:12:05,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:05,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1529920860, now seen corresponding path program 1 times [2023-11-29 05:12:05,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:05,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592055574] [2023-11-29 05:12:05,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:05,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:05,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:12:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:05,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:12:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:05,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:12:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:05,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:12:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:05,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:12:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:05,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:12:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:05,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:12:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:05,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:12:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:05,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:12:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:05,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:12:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:05,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:12:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:05,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:12:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:05,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:12:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:05,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:12:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:05,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:12:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:05,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:12:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:05,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:12:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:05,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:12:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:05,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:12:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:05,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:12:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:05,391 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:12:05,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:12:05,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592055574] [2023-11-29 05:12:05,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592055574] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:05,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:05,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:12:05,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259386571] [2023-11-29 05:12:05,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:05,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:12:05,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:12:05,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:12:05,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:12:05,394 INFO L87 Difference]: Start difference. First operand 584 states and 739 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:12:05,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:05,684 INFO L93 Difference]: Finished difference Result 1215 states and 1544 transitions. [2023-11-29 05:12:05,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:12:05,685 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2023-11-29 05:12:05,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:05,688 INFO L225 Difference]: With dead ends: 1215 [2023-11-29 05:12:05,688 INFO L226 Difference]: Without dead ends: 632 [2023-11-29 05:12:05,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:12:05,690 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 263 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:05,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 492 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:12:05,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2023-11-29 05:12:05,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 580. [2023-11-29 05:12:05,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 525 states have (on average 1.24) internal successors, (651), 525 states have internal predecessors, (651), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-29 05:12:05,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 731 transitions. [2023-11-29 05:12:05,771 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 731 transitions. Word has length 156 [2023-11-29 05:12:05,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:05,772 INFO L495 AbstractCegarLoop]: Abstraction has 580 states and 731 transitions. [2023-11-29 05:12:05,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:12:05,772 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 731 transitions. [2023-11-29 05:12:05,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-29 05:12:05,773 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:05,773 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:05,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 05:12:05,773 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:12:05,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:05,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1378456435, now seen corresponding path program 1 times [2023-11-29 05:12:05,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:05,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014761042] [2023-11-29 05:12:05,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:05,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:06,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:12:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:06,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:12:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:06,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:12:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:06,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:12:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:06,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:12:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:06,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:12:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:06,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:12:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:06,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:12:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:06,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:12:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:06,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:12:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:06,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:12:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:06,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:12:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:06,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:12:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:06,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:12:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:06,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:12:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:06,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:12:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:06,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:12:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:06,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:12:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:06,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:12:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:06,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:12:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:06,118 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:12:06,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:12:06,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014761042] [2023-11-29 05:12:06,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014761042] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:06,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:06,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:12:06,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053920167] [2023-11-29 05:12:06,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:06,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:12:06,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:12:06,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:12:06,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:12:06,120 INFO L87 Difference]: Start difference. First operand 580 states and 731 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:12:06,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:06,383 INFO L93 Difference]: Finished difference Result 1374 states and 1735 transitions. [2023-11-29 05:12:06,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:12:06,384 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2023-11-29 05:12:06,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:06,387 INFO L225 Difference]: With dead ends: 1374 [2023-11-29 05:12:06,387 INFO L226 Difference]: Without dead ends: 795 [2023-11-29 05:12:06,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:12:06,389 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 193 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:06,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 470 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:12:06,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2023-11-29 05:12:06,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 761. [2023-11-29 05:12:06,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 706 states have (on average 1.2436260623229463) internal successors, (878), 706 states have internal predecessors, (878), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-29 05:12:06,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 958 transitions. [2023-11-29 05:12:06,500 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 958 transitions. Word has length 156 [2023-11-29 05:12:06,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:06,501 INFO L495 AbstractCegarLoop]: Abstraction has 761 states and 958 transitions. [2023-11-29 05:12:06,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:12:06,501 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 958 transitions. [2023-11-29 05:12:06,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-29 05:12:06,503 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:06,503 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:06,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 05:12:06,503 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:12:06,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:06,504 INFO L85 PathProgramCache]: Analyzing trace with hash 985429425, now seen corresponding path program 1 times [2023-11-29 05:12:06,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:06,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727003585] [2023-11-29 05:12:06,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:06,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:07,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:12:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:07,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:12:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:07,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:12:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:07,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:12:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:07,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:12:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:07,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:12:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:07,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:12:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:07,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:12:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:07,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:12:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:07,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:12:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:07,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:12:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:07,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:12:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:07,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:12:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:07,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:12:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:07,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:12:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:07,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:12:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:07,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:12:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:07,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:12:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:07,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:12:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:07,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:12:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:07,906 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:12:07,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:12:07,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727003585] [2023-11-29 05:12:07,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727003585] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:07,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:07,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-29 05:12:07,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668294790] [2023-11-29 05:12:07,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:07,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 05:12:07,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:12:07,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 05:12:07,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2023-11-29 05:12:07,908 INFO L87 Difference]: Start difference. First operand 761 states and 958 transitions. Second operand has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2023-11-29 05:12:08,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:08,900 INFO L93 Difference]: Finished difference Result 1693 states and 2151 transitions. [2023-11-29 05:12:08,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 05:12:08,901 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 156 [2023-11-29 05:12:08,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:08,904 INFO L225 Difference]: With dead ends: 1693 [2023-11-29 05:12:08,904 INFO L226 Difference]: Without dead ends: 933 [2023-11-29 05:12:08,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=240, Invalid=752, Unknown=0, NotChecked=0, Total=992 [2023-11-29 05:12:08,906 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 516 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:08,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 1351 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:12:08,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2023-11-29 05:12:09,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 823. [2023-11-29 05:12:09,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 768 states have (on average 1.2526041666666667) internal successors, (962), 768 states have internal predecessors, (962), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-29 05:12:09,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1042 transitions. [2023-11-29 05:12:09,017 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1042 transitions. Word has length 156 [2023-11-29 05:12:09,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:09,017 INFO L495 AbstractCegarLoop]: Abstraction has 823 states and 1042 transitions. [2023-11-29 05:12:09,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2023-11-29 05:12:09,017 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1042 transitions. [2023-11-29 05:12:09,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-29 05:12:09,019 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:09,020 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:09,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 05:12:09,020 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:12:09,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:09,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1316416821, now seen corresponding path program 1 times [2023-11-29 05:12:09,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:09,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553485292] [2023-11-29 05:12:09,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:09,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:12:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:12:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:12:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:12:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:12:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:12:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:12:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:12:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:12:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:12:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:12:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:12:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:12:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:12:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:12:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:12:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:12:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:12:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:12:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:12:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,193 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:12:09,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:12:09,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553485292] [2023-11-29 05:12:09,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553485292] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:09,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:09,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:12:09,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678603145] [2023-11-29 05:12:09,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:09,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:12:09,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:12:09,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:12:09,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:12:09,195 INFO L87 Difference]: Start difference. First operand 823 states and 1042 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:12:09,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:09,343 INFO L93 Difference]: Finished difference Result 1597 states and 2034 transitions. [2023-11-29 05:12:09,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:12:09,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2023-11-29 05:12:09,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:09,347 INFO L225 Difference]: With dead ends: 1597 [2023-11-29 05:12:09,347 INFO L226 Difference]: Without dead ends: 775 [2023-11-29 05:12:09,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:12:09,348 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 53 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:09,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 674 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:12:09,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2023-11-29 05:12:09,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 696. [2023-11-29 05:12:09,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 641 states have (on average 1.251170046801872) internal successors, (802), 641 states have internal predecessors, (802), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-29 05:12:09,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 882 transitions. [2023-11-29 05:12:09,495 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 882 transitions. Word has length 156 [2023-11-29 05:12:09,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:09,495 INFO L495 AbstractCegarLoop]: Abstraction has 696 states and 882 transitions. [2023-11-29 05:12:09,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:12:09,495 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 882 transitions. [2023-11-29 05:12:09,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-29 05:12:09,497 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:09,497 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:09,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 05:12:09,497 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:12:09,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:09,498 INFO L85 PathProgramCache]: Analyzing trace with hash -610264138, now seen corresponding path program 1 times [2023-11-29 05:12:09,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:09,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455351824] [2023-11-29 05:12:09,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:09,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:12:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:12:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:12:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:12:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:12:09,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:12:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:12:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:12:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:12:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:12:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:12:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:12:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:12:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:12:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:12:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:12:09,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:12:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:12:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:12:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:12:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,689 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:12:09,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:12:09,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455351824] [2023-11-29 05:12:09,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455351824] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:09,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:09,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:12:09,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449559155] [2023-11-29 05:12:09,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:09,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:12:09,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:12:09,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:12:09,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:12:09,692 INFO L87 Difference]: Start difference. First operand 696 states and 882 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:12:09,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:09,970 INFO L93 Difference]: Finished difference Result 1895 states and 2394 transitions. [2023-11-29 05:12:09,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:12:09,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2023-11-29 05:12:09,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:09,974 INFO L225 Difference]: With dead ends: 1895 [2023-11-29 05:12:09,975 INFO L226 Difference]: Without dead ends: 1200 [2023-11-29 05:12:09,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:12:09,976 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 97 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:09,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 381 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:12:09,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2023-11-29 05:12:10,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1000. [2023-11-29 05:12:10,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 918 states have (on average 1.261437908496732) internal successors, (1158), 918 states have internal predecessors, (1158), 60 states have call successors, (60), 21 states have call predecessors, (60), 21 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-11-29 05:12:10,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1278 transitions. [2023-11-29 05:12:10,100 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1278 transitions. Word has length 157 [2023-11-29 05:12:10,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:10,101 INFO L495 AbstractCegarLoop]: Abstraction has 1000 states and 1278 transitions. [2023-11-29 05:12:10,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:12:10,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1278 transitions. [2023-11-29 05:12:10,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-29 05:12:10,103 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:10,103 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:10,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 05:12:10,104 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:12:10,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:10,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1197070152, now seen corresponding path program 1 times [2023-11-29 05:12:10,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:10,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222842594] [2023-11-29 05:12:10,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:10,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:12,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:12:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:12,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:12:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:12,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:12:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:12,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:12:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:12,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:12:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:12,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:12:12,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:12,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:12:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:12,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:12:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:12,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:12:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:12,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:12:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:12,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:12:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:12,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:12:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:12,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:12:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:12,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:12:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:12,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:12:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:12,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:12:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:12,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:12:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:12,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:12:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:12,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:12:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:12,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:12:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:12,247 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:12:12,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:12:12,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222842594] [2023-11-29 05:12:12,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222842594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:12,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:12,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-29 05:12:12,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791953382] [2023-11-29 05:12:12,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:12,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 05:12:12,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:12:12,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 05:12:12,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:12:12,249 INFO L87 Difference]: Start difference. First operand 1000 states and 1278 transitions. Second operand has 13 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2023-11-29 05:12:23,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:23,943 INFO L93 Difference]: Finished difference Result 2336 states and 2951 transitions. [2023-11-29 05:12:23,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 05:12:23,943 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 157 [2023-11-29 05:12:23,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:23,949 INFO L225 Difference]: With dead ends: 2336 [2023-11-29 05:12:23,949 INFO L226 Difference]: Without dead ends: 1633 [2023-11-29 05:12:23,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2023-11-29 05:12:23,951 INFO L413 NwaCegarLoop]: 335 mSDtfsCounter, 363 mSDsluCounter, 2183 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 2518 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:23,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 2518 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 05:12:23,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2023-11-29 05:12:24,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1180. [2023-11-29 05:12:24,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1098 states have (on average 1.2622950819672132) internal successors, (1386), 1098 states have internal predecessors, (1386), 60 states have call successors, (60), 21 states have call predecessors, (60), 21 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-11-29 05:12:24,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1506 transitions. [2023-11-29 05:12:24,160 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1506 transitions. Word has length 157 [2023-11-29 05:12:24,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:24,160 INFO L495 AbstractCegarLoop]: Abstraction has 1180 states and 1506 transitions. [2023-11-29 05:12:24,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2023-11-29 05:12:24,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1506 transitions. [2023-11-29 05:12:24,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-29 05:12:24,163 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:24,163 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:24,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 05:12:24,163 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:12:24,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:24,164 INFO L85 PathProgramCache]: Analyzing trace with hash -698471256, now seen corresponding path program 1 times [2023-11-29 05:12:24,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:24,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842602765] [2023-11-29 05:12:24,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:24,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:25,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:12:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:25,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:12:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:25,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:12:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:25,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:12:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:25,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:12:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:25,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:12:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:25,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:12:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:25,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:12:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:25,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:12:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:25,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:12:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:25,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:12:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:25,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:12:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:25,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:12:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:25,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:12:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:25,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:12:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:25,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:12:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:25,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:12:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:25,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:12:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:25,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:12:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:25,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:12:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:25,150 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:12:25,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:12:25,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842602765] [2023-11-29 05:12:25,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842602765] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:25,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:25,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-29 05:12:25,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751118244] [2023-11-29 05:12:25,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:25,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 05:12:25,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:12:25,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 05:12:25,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2023-11-29 05:12:25,151 INFO L87 Difference]: Start difference. First operand 1180 states and 1506 transitions. Second operand has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:12:26,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:26,379 INFO L93 Difference]: Finished difference Result 3132 states and 3969 transitions. [2023-11-29 05:12:26,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 05:12:26,380 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 158 [2023-11-29 05:12:26,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:26,387 INFO L225 Difference]: With dead ends: 3132 [2023-11-29 05:12:26,388 INFO L226 Difference]: Without dead ends: 2257 [2023-11-29 05:12:26,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=765, Unknown=0, NotChecked=0, Total=992 [2023-11-29 05:12:26,389 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 590 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:26,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 1452 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 05:12:26,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2023-11-29 05:12:26,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 1452. [2023-11-29 05:12:26,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1452 states, 1316 states have (on average 1.243161094224924) internal successors, (1636), 1316 states have internal predecessors, (1636), 100 states have call successors, (100), 35 states have call predecessors, (100), 35 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2023-11-29 05:12:26,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 1836 transitions. [2023-11-29 05:12:26,623 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 1836 transitions. Word has length 158 [2023-11-29 05:12:26,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:26,624 INFO L495 AbstractCegarLoop]: Abstraction has 1452 states and 1836 transitions. [2023-11-29 05:12:26,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:12:26,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1836 transitions. [2023-11-29 05:12:26,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-29 05:12:26,626 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:26,626 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:26,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 05:12:26,626 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:12:26,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:26,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1076536106, now seen corresponding path program 1 times [2023-11-29 05:12:26,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:26,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066257522] [2023-11-29 05:12:26,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:26,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:27,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:12:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:27,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:12:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:27,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:12:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:27,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:12:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:27,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:12:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:27,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:12:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:27,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:12:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:27,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:12:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:27,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:12:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:27,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:12:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:27,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:12:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:27,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:12:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:27,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:12:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:27,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:12:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:27,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:12:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:27,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:12:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:27,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:12:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:27,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:12:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:27,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:12:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:27,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:12:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:27,100 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:12:27,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:12:27,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066257522] [2023-11-29 05:12:27,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066257522] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:27,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:27,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-29 05:12:27,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663804672] [2023-11-29 05:12:27,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:27,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 05:12:27,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:12:27,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 05:12:27,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:12:27,102 INFO L87 Difference]: Start difference. First operand 1452 states and 1836 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:12:28,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:28,062 INFO L93 Difference]: Finished difference Result 2839 states and 3561 transitions. [2023-11-29 05:12:28,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 05:12:28,062 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 158 [2023-11-29 05:12:28,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:28,068 INFO L225 Difference]: With dead ends: 2839 [2023-11-29 05:12:28,069 INFO L226 Difference]: Without dead ends: 1696 [2023-11-29 05:12:28,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=652, Unknown=0, NotChecked=0, Total=812 [2023-11-29 05:12:28,070 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 368 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:28,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 782 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:12:28,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states. [2023-11-29 05:12:28,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1512. [2023-11-29 05:12:28,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1376 states have (on average 1.2318313953488371) internal successors, (1695), 1376 states have internal predecessors, (1695), 100 states have call successors, (100), 35 states have call predecessors, (100), 35 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2023-11-29 05:12:28,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1895 transitions. [2023-11-29 05:12:28,300 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1895 transitions. Word has length 158 [2023-11-29 05:12:28,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:28,300 INFO L495 AbstractCegarLoop]: Abstraction has 1512 states and 1895 transitions. [2023-11-29 05:12:28,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:12:28,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1895 transitions. [2023-11-29 05:12:28,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-29 05:12:28,301 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:28,302 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:28,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 05:12:28,302 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:12:28,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:28,302 INFO L85 PathProgramCache]: Analyzing trace with hash -557922646, now seen corresponding path program 1 times [2023-11-29 05:12:28,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:28,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874244677] [2023-11-29 05:12:28,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:28,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:28,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:12:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:28,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:12:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:28,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:12:28,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:28,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:12:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:28,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:12:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:28,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:12:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:28,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:12:28,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:28,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:12:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:28,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:12:28,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:28,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:12:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:28,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:12:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:28,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:12:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:28,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:12:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:28,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:12:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:28,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:12:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:28,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:12:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:28,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:12:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:28,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:12:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:28,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:12:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:28,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:12:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:28,819 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:12:28,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:12:28,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874244677] [2023-11-29 05:12:28,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874244677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:28,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:28,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-29 05:12:28,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191219337] [2023-11-29 05:12:28,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:28,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 05:12:28,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:12:28,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 05:12:28,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:12:28,821 INFO L87 Difference]: Start difference. First operand 1512 states and 1895 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:12:29,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:29,924 INFO L93 Difference]: Finished difference Result 2673 states and 3340 transitions. [2023-11-29 05:12:29,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 05:12:29,924 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 158 [2023-11-29 05:12:29,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:29,930 INFO L225 Difference]: With dead ends: 2673 [2023-11-29 05:12:29,930 INFO L226 Difference]: Without dead ends: 1732 [2023-11-29 05:12:29,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2023-11-29 05:12:29,932 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 328 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:29,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 999 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 05:12:29,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2023-11-29 05:12:30,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1548. [2023-11-29 05:12:30,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1548 states, 1412 states have (on average 1.2259206798866855) internal successors, (1731), 1412 states have internal predecessors, (1731), 100 states have call successors, (100), 35 states have call predecessors, (100), 35 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2023-11-29 05:12:30,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 1931 transitions. [2023-11-29 05:12:30,201 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 1931 transitions. Word has length 158 [2023-11-29 05:12:30,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:30,202 INFO L495 AbstractCegarLoop]: Abstraction has 1548 states and 1931 transitions. [2023-11-29 05:12:30,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:12:30,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 1931 transitions. [2023-11-29 05:12:30,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-29 05:12:30,203 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:30,203 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:30,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 05:12:30,203 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:12:30,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:30,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1217084716, now seen corresponding path program 1 times [2023-11-29 05:12:30,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:30,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409030787] [2023-11-29 05:12:30,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:30,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:30,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:12:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:30,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:12:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:30,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:12:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:30,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:12:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:30,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:12:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:30,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:12:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:30,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:12:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:30,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:12:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:30,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:12:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:30,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:12:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:30,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:12:30,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:30,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:12:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:30,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:12:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:30,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:12:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:30,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:12:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:30,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:12:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:30,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:12:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:30,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:12:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:30,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:12:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:30,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:12:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:30,975 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:12:30,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:12:30,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409030787] [2023-11-29 05:12:30,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409030787] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:30,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:30,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:12:30,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049560238] [2023-11-29 05:12:30,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:30,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:12:30,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:12:30,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:12:30,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:12:30,977 INFO L87 Difference]: Start difference. First operand 1548 states and 1931 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:12:32,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:32,103 INFO L93 Difference]: Finished difference Result 3021 states and 3739 transitions. [2023-11-29 05:12:32,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 05:12:32,104 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2023-11-29 05:12:32,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:32,111 INFO L225 Difference]: With dead ends: 3021 [2023-11-29 05:12:32,111 INFO L226 Difference]: Without dead ends: 2044 [2023-11-29 05:12:32,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2023-11-29 05:12:32,113 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 192 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:32,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 1159 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:12:32,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2023-11-29 05:12:32,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 1884. [2023-11-29 05:12:32,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1748 states have (on average 1.2139588100686498) internal successors, (2122), 1748 states have internal predecessors, (2122), 100 states have call successors, (100), 35 states have call predecessors, (100), 35 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2023-11-29 05:12:32,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2322 transitions. [2023-11-29 05:12:32,363 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 2322 transitions. Word has length 158 [2023-11-29 05:12:32,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:32,364 INFO L495 AbstractCegarLoop]: Abstraction has 1884 states and 2322 transitions. [2023-11-29 05:12:32,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:12:32,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2322 transitions. [2023-11-29 05:12:32,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-29 05:12:32,366 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:32,366 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:32,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 05:12:32,366 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:12:32,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:32,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1012558462, now seen corresponding path program 1 times [2023-11-29 05:12:32,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:32,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335098697] [2023-11-29 05:12:32,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:32,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:32,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:12:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:32,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:12:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:32,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:12:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:32,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:12:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:32,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:12:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:32,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:12:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:32,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:12:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:32,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:12:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:32,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:12:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:32,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:12:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:32,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:12:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:32,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:12:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:32,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:12:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:32,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:12:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:32,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:12:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:32,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:12:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:32,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:12:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:32,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:12:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:32,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:12:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:32,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:12:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:32,786 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:12:32,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:12:32,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335098697] [2023-11-29 05:12:32,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335098697] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:32,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:32,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:12:32,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494964051] [2023-11-29 05:12:32,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:32,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:12:32,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:12:32,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:12:32,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:12:32,788 INFO L87 Difference]: Start difference. First operand 1884 states and 2322 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:12:33,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:33,394 INFO L93 Difference]: Finished difference Result 3675 states and 4538 transitions. [2023-11-29 05:12:33,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:12:33,394 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 158 [2023-11-29 05:12:33,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:33,402 INFO L225 Difference]: With dead ends: 3675 [2023-11-29 05:12:33,402 INFO L226 Difference]: Without dead ends: 2426 [2023-11-29 05:12:33,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:12:33,404 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 564 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:33,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 447 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:12:33,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2426 states. [2023-11-29 05:12:33,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2426 to 2043. [2023-11-29 05:12:33,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2043 states, 1907 states have (on average 1.2197168327215522) internal successors, (2326), 1907 states have internal predecessors, (2326), 100 states have call successors, (100), 35 states have call predecessors, (100), 35 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2023-11-29 05:12:33,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 2043 states and 2526 transitions. [2023-11-29 05:12:33,653 INFO L78 Accepts]: Start accepts. Automaton has 2043 states and 2526 transitions. Word has length 158 [2023-11-29 05:12:33,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:33,653 INFO L495 AbstractCegarLoop]: Abstraction has 2043 states and 2526 transitions. [2023-11-29 05:12:33,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:12:33,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2043 states and 2526 transitions. [2023-11-29 05:12:33,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-29 05:12:33,654 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:33,655 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:33,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-29 05:12:33,655 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:12:33,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:33,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1054237908, now seen corresponding path program 1 times [2023-11-29 05:12:33,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:33,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813372636] [2023-11-29 05:12:33,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:33,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:33,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:12:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:33,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:12:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:33,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:12:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:33,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:12:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:33,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:12:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:33,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:12:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:33,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:12:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:33,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:12:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:33,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:12:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:33,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:12:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:33,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:12:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:33,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:12:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:33,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:12:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:33,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:12:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:33,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:12:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:33,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:12:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:33,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:12:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:33,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:12:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:33,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:12:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:33,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:12:33,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:33,920 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:12:33,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:12:33,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813372636] [2023-11-29 05:12:33,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813372636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:33,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:33,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:12:33,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333445384] [2023-11-29 05:12:33,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:33,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:12:33,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:12:33,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:12:33,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:12:33,922 INFO L87 Difference]: Start difference. First operand 2043 states and 2526 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:12:34,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:34,240 INFO L93 Difference]: Finished difference Result 3447 states and 4262 transitions. [2023-11-29 05:12:34,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:12:34,241 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2023-11-29 05:12:34,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:34,250 INFO L225 Difference]: With dead ends: 3447 [2023-11-29 05:12:34,250 INFO L226 Difference]: Without dead ends: 2073 [2023-11-29 05:12:34,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:12:34,252 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 140 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:34,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 491 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:12:34,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2073 states. [2023-11-29 05:12:34,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2073 to 2043. [2023-11-29 05:12:34,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2043 states, 1907 states have (on average 1.1945464079706345) internal successors, (2278), 1907 states have internal predecessors, (2278), 100 states have call successors, (100), 35 states have call predecessors, (100), 35 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2023-11-29 05:12:34,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 2043 states and 2478 transitions. [2023-11-29 05:12:34,485 INFO L78 Accepts]: Start accepts. Automaton has 2043 states and 2478 transitions. Word has length 158 [2023-11-29 05:12:34,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:34,486 INFO L495 AbstractCegarLoop]: Abstraction has 2043 states and 2478 transitions. [2023-11-29 05:12:34,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:12:34,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2043 states and 2478 transitions. [2023-11-29 05:12:34,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-29 05:12:34,488 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:34,488 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:34,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-29 05:12:34,489 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:12:34,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:34,489 INFO L85 PathProgramCache]: Analyzing trace with hash -609181995, now seen corresponding path program 1 times [2023-11-29 05:12:34,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:34,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312381340] [2023-11-29 05:12:34,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:34,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:35,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:12:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:35,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:12:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:35,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:12:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:35,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:12:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:35,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:12:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:35,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:12:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:35,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:12:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:35,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:12:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:35,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:12:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:35,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:12:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:35,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:12:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:35,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:12:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:35,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:12:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:35,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:12:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:35,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:12:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:35,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:12:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:35,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:12:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:35,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:12:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:35,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:12:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:35,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:12:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:35,117 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:12:35,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:12:35,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312381340] [2023-11-29 05:12:35,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312381340] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:35,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:35,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-29 05:12:35,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439686560] [2023-11-29 05:12:35,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:35,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 05:12:35,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:12:35,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 05:12:35,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:12:35,119 INFO L87 Difference]: Start difference. First operand 2043 states and 2478 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:12:36,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:36,335 INFO L93 Difference]: Finished difference Result 4210 states and 5067 transitions. [2023-11-29 05:12:36,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 05:12:36,336 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2023-11-29 05:12:36,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:36,348 INFO L225 Difference]: With dead ends: 4210 [2023-11-29 05:12:36,348 INFO L226 Difference]: Without dead ends: 2872 [2023-11-29 05:12:36,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=356, Invalid=1050, Unknown=0, NotChecked=0, Total=1406 [2023-11-29 05:12:36,351 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 652 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:36,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 1189 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:12:36,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2872 states. [2023-11-29 05:12:36,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2872 to 1813. [2023-11-29 05:12:36,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1813 states, 1677 states have (on average 1.184257602862254) internal successors, (1986), 1677 states have internal predecessors, (1986), 100 states have call successors, (100), 35 states have call predecessors, (100), 35 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2023-11-29 05:12:36,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 2186 transitions. [2023-11-29 05:12:36,604 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 2186 transitions. Word has length 158 [2023-11-29 05:12:36,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:36,604 INFO L495 AbstractCegarLoop]: Abstraction has 1813 states and 2186 transitions. [2023-11-29 05:12:36,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:12:36,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2186 transitions. [2023-11-29 05:12:36,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-29 05:12:36,605 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:36,606 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:36,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-29 05:12:36,606 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:12:36,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:36,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1207984548, now seen corresponding path program 1 times [2023-11-29 05:12:36,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:36,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426352608] [2023-11-29 05:12:36,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:36,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:38,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:12:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:38,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:12:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:38,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:12:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:38,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:12:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:38,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:12:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:38,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:12:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:38,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:12:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:38,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:12:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:38,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:12:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:38,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:12:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:38,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:12:38,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:38,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:12:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:38,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:12:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:38,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:12:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:38,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:12:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:38,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:12:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:38,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:12:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:38,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:12:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:38,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:12:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:38,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:12:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:38,074 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:12:38,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:12:38,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426352608] [2023-11-29 05:12:38,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426352608] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:38,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:38,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-11-29 05:12:38,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584817983] [2023-11-29 05:12:38,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:38,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 05:12:38,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:12:38,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 05:12:38,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2023-11-29 05:12:38,076 INFO L87 Difference]: Start difference. First operand 1813 states and 2186 transitions. Second operand has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 18 states have internal predecessors, (61), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2023-11-29 05:12:40,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:40,853 INFO L93 Difference]: Finished difference Result 4509 states and 5406 transitions. [2023-11-29 05:12:40,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-29 05:12:40,854 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 18 states have internal predecessors, (61), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 158 [2023-11-29 05:12:40,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:40,859 INFO L225 Difference]: With dead ends: 4509 [2023-11-29 05:12:40,859 INFO L226 Difference]: Without dead ends: 3393 [2023-11-29 05:12:40,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=480, Invalid=1776, Unknown=0, NotChecked=0, Total=2256 [2023-11-29 05:12:40,862 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 1176 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:40,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1176 Valid, 1540 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 05:12:40,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3393 states. [2023-11-29 05:12:41,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3393 to 2203. [2023-11-29 05:12:41,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2203 states, 2064 states have (on average 1.193313953488372) internal successors, (2463), 2064 states have internal predecessors, (2463), 100 states have call successors, (100), 38 states have call predecessors, (100), 38 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2023-11-29 05:12:41,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2203 states to 2203 states and 2663 transitions. [2023-11-29 05:12:41,150 INFO L78 Accepts]: Start accepts. Automaton has 2203 states and 2663 transitions. Word has length 158 [2023-11-29 05:12:41,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:41,150 INFO L495 AbstractCegarLoop]: Abstraction has 2203 states and 2663 transitions. [2023-11-29 05:12:41,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 18 states have internal predecessors, (61), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2023-11-29 05:12:41,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2203 states and 2663 transitions. [2023-11-29 05:12:41,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-29 05:12:41,152 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:41,153 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:41,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-29 05:12:41,153 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:12:41,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:41,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1311975386, now seen corresponding path program 1 times [2023-11-29 05:12:41,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:41,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992786644] [2023-11-29 05:12:41,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:41,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:41,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:12:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:41,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:12:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:41,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:12:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:41,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:12:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:41,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:12:41,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:41,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:12:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:41,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:12:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:41,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:12:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:41,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:12:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:41,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:12:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:41,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:12:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:41,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:12:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:41,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:12:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:41,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:12:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:41,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:12:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:41,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:12:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:41,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:12:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:41,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:12:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:41,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:12:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:41,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:12:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:41,758 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:12:41,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:12:41,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992786644] [2023-11-29 05:12:41,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992786644] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:41,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:41,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:12:41,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035769803] [2023-11-29 05:12:41,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:41,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:12:41,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:12:41,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:12:41,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:12:41,760 INFO L87 Difference]: Start difference. First operand 2203 states and 2663 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:12:42,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:42,566 INFO L93 Difference]: Finished difference Result 4137 states and 4991 transitions. [2023-11-29 05:12:42,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:12:42,567 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2023-11-29 05:12:42,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:42,570 INFO L225 Difference]: With dead ends: 4137 [2023-11-29 05:12:42,570 INFO L226 Difference]: Without dead ends: 2381 [2023-11-29 05:12:42,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:12:42,572 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 221 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:42,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 622 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:12:42,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2381 states. [2023-11-29 05:12:42,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2381 to 2127. [2023-11-29 05:12:42,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2127 states, 1988 states have (on average 1.1976861167002013) internal successors, (2381), 1988 states have internal predecessors, (2381), 100 states have call successors, (100), 38 states have call predecessors, (100), 38 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2023-11-29 05:12:42,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 2581 transitions. [2023-11-29 05:12:42,845 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 2581 transitions. Word has length 158 [2023-11-29 05:12:42,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:42,845 INFO L495 AbstractCegarLoop]: Abstraction has 2127 states and 2581 transitions. [2023-11-29 05:12:42,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:12:42,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 2581 transitions. [2023-11-29 05:12:42,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-29 05:12:42,846 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:42,847 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:42,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-29 05:12:42,847 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:12:42,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:42,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1348533158, now seen corresponding path program 1 times [2023-11-29 05:12:42,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:42,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397324088] [2023-11-29 05:12:42,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:42,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:43,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:12:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:43,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:12:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:43,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:12:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:43,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:12:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:43,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:12:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:43,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:12:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:43,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:12:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:43,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:12:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:43,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:12:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:43,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:12:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:43,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:12:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:43,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:12:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:43,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:12:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:43,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:12:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:43,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:12:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:43,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:12:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:43,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:12:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:43,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:12:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:43,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:12:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:43,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:12:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:43,513 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:12:43,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:12:43,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397324088] [2023-11-29 05:12:43,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397324088] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:43,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:43,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-29 05:12:43,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948692517] [2023-11-29 05:12:43,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:43,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 05:12:43,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:12:43,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 05:12:43,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:12:43,515 INFO L87 Difference]: Start difference. First operand 2127 states and 2581 transitions. Second operand has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-29 05:12:44,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:44,595 INFO L93 Difference]: Finished difference Result 3385 states and 4095 transitions. [2023-11-29 05:12:44,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:12:44,596 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 158 [2023-11-29 05:12:44,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:44,599 INFO L225 Difference]: With dead ends: 3385 [2023-11-29 05:12:44,599 INFO L226 Difference]: Without dead ends: 2303 [2023-11-29 05:12:44,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2023-11-29 05:12:44,601 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 334 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:44,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 947 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:12:44,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2303 states. [2023-11-29 05:12:44,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2303 to 2091. [2023-11-29 05:12:44,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2091 states, 1952 states have (on average 1.2003073770491803) internal successors, (2343), 1952 states have internal predecessors, (2343), 100 states have call successors, (100), 38 states have call predecessors, (100), 38 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2023-11-29 05:12:44,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 2091 states and 2543 transitions. [2023-11-29 05:12:44,889 INFO L78 Accepts]: Start accepts. Automaton has 2091 states and 2543 transitions. Word has length 158 [2023-11-29 05:12:44,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:44,889 INFO L495 AbstractCegarLoop]: Abstraction has 2091 states and 2543 transitions. [2023-11-29 05:12:44,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-29 05:12:44,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 2543 transitions. [2023-11-29 05:12:44,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-29 05:12:44,891 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:44,891 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:44,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-29 05:12:44,891 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:12:44,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:44,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1737974122, now seen corresponding path program 1 times [2023-11-29 05:12:44,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:44,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140793465] [2023-11-29 05:12:44,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:44,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:45,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:12:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:45,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:12:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:45,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:12:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:45,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:12:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:45,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:12:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:45,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:12:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:45,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:12:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:45,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:12:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:45,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:12:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:45,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:12:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:45,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:12:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:45,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:12:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:45,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:12:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:45,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:12:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:45,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:12:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:45,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:12:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:45,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:12:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:45,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:12:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:45,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:12:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:45,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:12:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:45,065 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:12:45,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:12:45,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140793465] [2023-11-29 05:12:45,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140793465] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:45,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:45,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:12:45,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818979625] [2023-11-29 05:12:45,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:45,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:12:45,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:12:45,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:12:45,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:12:45,067 INFO L87 Difference]: Start difference. First operand 2091 states and 2543 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:12:45,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:45,387 INFO L93 Difference]: Finished difference Result 2105 states and 2560 transitions. [2023-11-29 05:12:45,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:12:45,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2023-11-29 05:12:45,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:45,390 INFO L225 Difference]: With dead ends: 2105 [2023-11-29 05:12:45,390 INFO L226 Difference]: Without dead ends: 2103 [2023-11-29 05:12:45,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:12:45,391 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 7 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:45,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 538 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:12:45,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2103 states. [2023-11-29 05:12:45,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2103 to 2103. [2023-11-29 05:12:45,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2103 states, 1964 states have (on average 1.1990835030549898) internal successors, (2355), 1964 states have internal predecessors, (2355), 100 states have call successors, (100), 38 states have call predecessors, (100), 38 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2023-11-29 05:12:45,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 2103 states and 2555 transitions. [2023-11-29 05:12:45,659 INFO L78 Accepts]: Start accepts. Automaton has 2103 states and 2555 transitions. Word has length 160 [2023-11-29 05:12:45,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:45,659 INFO L495 AbstractCegarLoop]: Abstraction has 2103 states and 2555 transitions. [2023-11-29 05:12:45,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:12:45,659 INFO L276 IsEmpty]: Start isEmpty. Operand 2103 states and 2555 transitions. [2023-11-29 05:12:45,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-29 05:12:45,661 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:45,661 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:45,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-11-29 05:12:45,661 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:12:45,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:45,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1534361447, now seen corresponding path program 1 times [2023-11-29 05:12:45,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:45,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182008883] [2023-11-29 05:12:45,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:45,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:46,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:12:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:46,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:12:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:46,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:12:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:46,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:12:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:46,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:12:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:46,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:12:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:46,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:12:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:46,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:12:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:46,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:12:46,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:46,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:12:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:46,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:12:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:46,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:12:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:46,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:12:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:46,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:12:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:46,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:12:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:46,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:12:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:46,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:12:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:46,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:12:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:46,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:12:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:46,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:12:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:46,858 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:12:46,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:12:46,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182008883] [2023-11-29 05:12:46,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182008883] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:46,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:46,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-29 05:12:46,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795812074] [2023-11-29 05:12:46,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:46,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 05:12:46,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:12:46,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 05:12:46,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2023-11-29 05:12:46,859 INFO L87 Difference]: Start difference. First operand 2103 states and 2555 transitions. Second operand has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2023-11-29 05:12:48,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:48,188 INFO L93 Difference]: Finished difference Result 3291 states and 3980 transitions. [2023-11-29 05:12:48,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 05:12:48,189 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2023-11-29 05:12:48,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:48,192 INFO L225 Difference]: With dead ends: 3291 [2023-11-29 05:12:48,193 INFO L226 Difference]: Without dead ends: 2239 [2023-11-29 05:12:48,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=665, Unknown=0, NotChecked=0, Total=870 [2023-11-29 05:12:48,194 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 550 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:48,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 1597 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:12:48,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2239 states. [2023-11-29 05:12:48,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2239 to 2111. [2023-11-29 05:12:48,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2111 states, 1972 states have (on average 1.1982758620689655) internal successors, (2363), 1972 states have internal predecessors, (2363), 100 states have call successors, (100), 38 states have call predecessors, (100), 38 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2023-11-29 05:12:48,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 2563 transitions. [2023-11-29 05:12:48,509 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 2563 transitions. Word has length 160 [2023-11-29 05:12:48,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:48,510 INFO L495 AbstractCegarLoop]: Abstraction has 2111 states and 2563 transitions. [2023-11-29 05:12:48,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2023-11-29 05:12:48,510 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 2563 transitions. [2023-11-29 05:12:48,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-29 05:12:48,512 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:48,512 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:48,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-11-29 05:12:48,512 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:12:48,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:48,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1904756203, now seen corresponding path program 1 times [2023-11-29 05:12:48,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:48,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431262232] [2023-11-29 05:12:48,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:48,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:49,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:12:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:49,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:12:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:49,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:12:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:49,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:12:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:49,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:12:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:49,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:12:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:49,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:12:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:49,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:12:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:49,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:12:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:49,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:12:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:49,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:12:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:49,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:12:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:49,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:12:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:49,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:12:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:49,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:12:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:49,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:12:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:49,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:12:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:49,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:12:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:49,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:12:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:49,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:12:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:49,082 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:12:49,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:12:49,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431262232] [2023-11-29 05:12:49,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431262232] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:49,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:49,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:12:49,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156212620] [2023-11-29 05:12:49,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:49,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:12:49,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:12:49,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:12:49,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:12:49,084 INFO L87 Difference]: Start difference. First operand 2111 states and 2563 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:12:49,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:49,546 INFO L93 Difference]: Finished difference Result 3233 states and 3917 transitions. [2023-11-29 05:12:49,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 05:12:49,546 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2023-11-29 05:12:49,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:49,549 INFO L225 Difference]: With dead ends: 3233 [2023-11-29 05:12:49,550 INFO L226 Difference]: Without dead ends: 2173 [2023-11-29 05:12:49,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:12:49,551 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 113 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:49,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1218 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:12:49,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2173 states. [2023-11-29 05:12:49,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 2111. [2023-11-29 05:12:49,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2111 states, 1972 states have (on average 1.1982758620689655) internal successors, (2363), 1972 states have internal predecessors, (2363), 100 states have call successors, (100), 38 states have call predecessors, (100), 38 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2023-11-29 05:12:49,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 2563 transitions. [2023-11-29 05:12:49,834 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 2563 transitions. Word has length 160 [2023-11-29 05:12:49,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:49,835 INFO L495 AbstractCegarLoop]: Abstraction has 2111 states and 2563 transitions. [2023-11-29 05:12:49,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:12:49,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 2563 transitions. [2023-11-29 05:12:49,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-29 05:12:49,836 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:49,836 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:49,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-11-29 05:12:49,837 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:12:49,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:49,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1511729193, now seen corresponding path program 1 times [2023-11-29 05:12:49,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:49,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647779751] [2023-11-29 05:12:49,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:49,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:50,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:12:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:50,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:12:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:50,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:12:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:50,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:12:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:50,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:12:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:50,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:12:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:50,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:12:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:50,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:12:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:50,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:12:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:50,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:12:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:50,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:12:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:50,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:12:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:50,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:12:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:50,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:12:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:50,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:12:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:50,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:12:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:50,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:12:50,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:50,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:12:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:50,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:12:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:50,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:12:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:50,199 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:12:50,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:12:50,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647779751] [2023-11-29 05:12:50,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647779751] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:50,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:50,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:12:50,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949477565] [2023-11-29 05:12:50,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:50,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:12:50,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:12:50,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:12:50,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:12:50,201 INFO L87 Difference]: Start difference. First operand 2111 states and 2563 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:12:50,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:50,688 INFO L93 Difference]: Finished difference Result 3203 states and 3875 transitions. [2023-11-29 05:12:50,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:12:50,689 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2023-11-29 05:12:50,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:50,692 INFO L225 Difference]: With dead ends: 3203 [2023-11-29 05:12:50,692 INFO L226 Difference]: Without dead ends: 2143 [2023-11-29 05:12:50,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:12:50,694 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 245 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:50,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 481 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:12:50,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2023-11-29 05:12:50,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 2103. [2023-11-29 05:12:50,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2103 states, 1964 states have (on average 1.1970468431771895) internal successors, (2351), 1964 states have internal predecessors, (2351), 100 states have call successors, (100), 38 states have call predecessors, (100), 38 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2023-11-29 05:12:50,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 2103 states and 2551 transitions. [2023-11-29 05:12:50,964 INFO L78 Accepts]: Start accepts. Automaton has 2103 states and 2551 transitions. Word has length 160 [2023-11-29 05:12:50,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:50,964 INFO L495 AbstractCegarLoop]: Abstraction has 2103 states and 2551 transitions. [2023-11-29 05:12:50,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:12:50,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2103 states and 2551 transitions. [2023-11-29 05:12:50,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-29 05:12:50,966 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:50,966 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:50,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-11-29 05:12:50,967 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:12:50,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:50,967 INFO L85 PathProgramCache]: Analyzing trace with hash 856739249, now seen corresponding path program 1 times [2023-11-29 05:12:50,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:50,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715848253] [2023-11-29 05:12:50,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:50,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:51,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:12:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:51,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:12:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:51,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:12:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:51,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:12:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:51,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:12:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:51,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:12:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:51,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:12:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:51,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:12:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:51,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:12:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:51,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:12:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:51,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:12:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:51,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:12:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:51,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:12:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:51,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:12:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:51,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:12:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:51,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:12:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:51,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:12:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:51,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:12:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:51,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:12:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:51,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:12:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:51,386 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:12:51,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:12:51,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715848253] [2023-11-29 05:12:51,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715848253] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:51,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:51,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:12:51,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516267460] [2023-11-29 05:12:51,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:51,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:12:51,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:12:51,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:12:51,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:12:51,388 INFO L87 Difference]: Start difference. First operand 2103 states and 2551 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:12:52,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:52,026 INFO L93 Difference]: Finished difference Result 2582 states and 3118 transitions. [2023-11-29 05:12:52,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 05:12:52,026 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2023-11-29 05:12:52,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:52,031 INFO L225 Difference]: With dead ends: 2582 [2023-11-29 05:12:52,031 INFO L226 Difference]: Without dead ends: 2580 [2023-11-29 05:12:52,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2023-11-29 05:12:52,032 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 292 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:52,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 787 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:12:52,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2023-11-29 05:12:52,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2468. [2023-11-29 05:12:52,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2468 states, 2329 states have (on average 1.1949334478316873) internal successors, (2783), 2329 states have internal predecessors, (2783), 100 states have call successors, (100), 38 states have call predecessors, (100), 38 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2023-11-29 05:12:52,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2468 states and 2983 transitions. [2023-11-29 05:12:52,331 INFO L78 Accepts]: Start accepts. Automaton has 2468 states and 2983 transitions. Word has length 162 [2023-11-29 05:12:52,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:52,331 INFO L495 AbstractCegarLoop]: Abstraction has 2468 states and 2983 transitions. [2023-11-29 05:12:52,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:12:52,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2468 states and 2983 transitions. [2023-11-29 05:12:52,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-29 05:12:52,333 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:52,333 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:52,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-11-29 05:12:52,333 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:12:52,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:52,334 INFO L85 PathProgramCache]: Analyzing trace with hash -699110516, now seen corresponding path program 1 times [2023-11-29 05:12:52,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:52,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654885596] [2023-11-29 05:12:52,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:52,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:53,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:12:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:53,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:12:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:53,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:12:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:53,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:12:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:53,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:12:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:53,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:12:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:53,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:12:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:53,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:12:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:53,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:12:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:53,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:12:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:53,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:12:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:53,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:12:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:53,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:12:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:53,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:12:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:53,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:12:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:53,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:12:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:53,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:12:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:53,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:12:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:53,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:12:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:53,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:12:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:53,471 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:12:53,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:12:53,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654885596] [2023-11-29 05:12:53,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654885596] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:53,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:53,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-11-29 05:12:53,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036108286] [2023-11-29 05:12:53,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:53,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 05:12:53,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:12:53,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 05:12:53,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2023-11-29 05:12:53,473 INFO L87 Difference]: Start difference. First operand 2468 states and 2983 transitions. Second operand has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:12:55,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:55,362 INFO L93 Difference]: Finished difference Result 5561 states and 6660 transitions. [2023-11-29 05:12:55,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-29 05:12:55,362 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 162 [2023-11-29 05:12:55,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:55,369 INFO L225 Difference]: With dead ends: 5561 [2023-11-29 05:12:55,369 INFO L226 Difference]: Without dead ends: 4291 [2023-11-29 05:12:55,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=357, Invalid=1283, Unknown=0, NotChecked=0, Total=1640 [2023-11-29 05:12:55,372 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 1042 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:55,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 1519 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 05:12:55,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4291 states. [2023-11-29 05:12:55,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4291 to 2937. [2023-11-29 05:12:55,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2937 states, 2742 states have (on average 1.1834427425237053) internal successors, (3245), 2742 states have internal predecessors, (3245), 140 states have call successors, (140), 54 states have call predecessors, (140), 54 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2023-11-29 05:12:55,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2937 states to 2937 states and 3525 transitions. [2023-11-29 05:12:55,793 INFO L78 Accepts]: Start accepts. Automaton has 2937 states and 3525 transitions. Word has length 162 [2023-11-29 05:12:55,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:55,793 INFO L495 AbstractCegarLoop]: Abstraction has 2937 states and 3525 transitions. [2023-11-29 05:12:55,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:12:55,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2937 states and 3525 transitions. [2023-11-29 05:12:55,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-29 05:12:55,795 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:55,795 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:55,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-11-29 05:12:55,795 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:12:55,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:55,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1075896846, now seen corresponding path program 1 times [2023-11-29 05:12:55,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:55,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275806664] [2023-11-29 05:12:55,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:55,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:56,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:12:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:56,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:12:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:56,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:12:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:56,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:12:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:56,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:12:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:56,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:12:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:56,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:12:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:56,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:12:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:56,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:12:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:56,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:12:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:56,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:12:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:56,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:12:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:56,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:12:56,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:56,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:12:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:56,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:12:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:56,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:12:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:56,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:12:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:56,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:12:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:56,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:12:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:56,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:12:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:56,701 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:12:56,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:12:56,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275806664] [2023-11-29 05:12:56,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275806664] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:56,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:56,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-29 05:12:56,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949828563] [2023-11-29 05:12:56,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:56,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 05:12:56,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:12:56,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 05:12:56,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-11-29 05:12:56,704 INFO L87 Difference]: Start difference. First operand 2937 states and 3525 transitions. Second operand has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:12:58,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:58,389 INFO L93 Difference]: Finished difference Result 4768 states and 5701 transitions. [2023-11-29 05:12:58,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 05:12:58,390 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 162 [2023-11-29 05:12:58,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:58,395 INFO L225 Difference]: With dead ends: 4768 [2023-11-29 05:12:58,395 INFO L226 Difference]: Without dead ends: 3498 [2023-11-29 05:12:58,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=178, Invalid=752, Unknown=0, NotChecked=0, Total=930 [2023-11-29 05:12:58,397 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 426 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:58,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1011 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 05:12:58,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3498 states. [2023-11-29 05:12:58,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3498 to 2985. [2023-11-29 05:12:58,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2985 states, 2790 states have (on average 1.1824372759856632) internal successors, (3299), 2790 states have internal predecessors, (3299), 140 states have call successors, (140), 54 states have call predecessors, (140), 54 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2023-11-29 05:12:58,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2985 states to 2985 states and 3579 transitions. [2023-11-29 05:12:58,816 INFO L78 Accepts]: Start accepts. Automaton has 2985 states and 3579 transitions. Word has length 162 [2023-11-29 05:12:58,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:58,816 INFO L495 AbstractCegarLoop]: Abstraction has 2985 states and 3579 transitions. [2023-11-29 05:12:58,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:12:58,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2985 states and 3579 transitions. [2023-11-29 05:12:58,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-29 05:12:58,818 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:58,818 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:58,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-11-29 05:12:58,819 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:12:58,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:58,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1601712074, now seen corresponding path program 1 times [2023-11-29 05:12:58,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:58,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485425368] [2023-11-29 05:12:58,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:58,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:59,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:12:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:59,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:12:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:59,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:12:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:59,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:12:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:59,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:12:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:59,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:12:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:59,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:12:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:59,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:12:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:59,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:12:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:59,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:12:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:59,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:12:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:59,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:12:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:59,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:12:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:59,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:12:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:59,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:12:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:59,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:12:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:59,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:12:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:59,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:12:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:59,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:12:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:59,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:12:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:59,307 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:12:59,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:12:59,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485425368] [2023-11-29 05:12:59,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485425368] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:59,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:59,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:12:59,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189548100] [2023-11-29 05:12:59,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:59,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:12:59,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:12:59,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:12:59,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:12:59,309 INFO L87 Difference]: Start difference. First operand 2985 states and 3579 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:13:00,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:13:00,196 INFO L93 Difference]: Finished difference Result 5000 states and 5927 transitions. [2023-11-29 05:13:00,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:13:00,196 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2023-11-29 05:13:00,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:13:00,201 INFO L225 Difference]: With dead ends: 5000 [2023-11-29 05:13:00,201 INFO L226 Difference]: Without dead ends: 3662 [2023-11-29 05:13:00,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:13:00,204 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 246 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:13:00,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 745 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:13:00,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2023-11-29 05:13:00,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 2993. [2023-11-29 05:13:00,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2993 states, 2798 states have (on average 1.181915654038599) internal successors, (3307), 2798 states have internal predecessors, (3307), 140 states have call successors, (140), 54 states have call predecessors, (140), 54 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2023-11-29 05:13:00,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2993 states to 2993 states and 3587 transitions. [2023-11-29 05:13:00,637 INFO L78 Accepts]: Start accepts. Automaton has 2993 states and 3587 transitions. Word has length 162 [2023-11-29 05:13:00,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:13:00,637 INFO L495 AbstractCegarLoop]: Abstraction has 2993 states and 3587 transitions. [2023-11-29 05:13:00,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:13:00,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 3587 transitions. [2023-11-29 05:13:00,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-29 05:13:00,639 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:13:00,639 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:13:00,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-11-29 05:13:00,639 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:13:00,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:13:00,640 INFO L85 PathProgramCache]: Analyzing trace with hash 687092878, now seen corresponding path program 1 times [2023-11-29 05:13:00,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:13:00,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16471238] [2023-11-29 05:13:00,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:13:00,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:13:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:01,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:13:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:01,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:13:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:01,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:13:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:01,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:13:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:01,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:13:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:01,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:13:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:01,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:13:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:01,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:13:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:01,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:13:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:01,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:13:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:01,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:13:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:01,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:13:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:01,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:13:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:01,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:13:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:01,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:13:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:01,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:13:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:01,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:13:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:01,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:13:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:01,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:13:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:01,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:13:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:01,600 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:13:01,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:13:01,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16471238] [2023-11-29 05:13:01,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16471238] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:13:01,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:13:01,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-29 05:13:01,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629768256] [2023-11-29 05:13:01,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:13:01,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 05:13:01,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:13:01,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 05:13:01,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-11-29 05:13:01,602 INFO L87 Difference]: Start difference. First operand 2993 states and 3587 transitions. Second operand has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:13:03,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:13:03,498 INFO L93 Difference]: Finished difference Result 4691 states and 5603 transitions. [2023-11-29 05:13:03,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 05:13:03,499 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 162 [2023-11-29 05:13:03,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:13:03,502 INFO L225 Difference]: With dead ends: 4691 [2023-11-29 05:13:03,502 INFO L226 Difference]: Without dead ends: 3349 [2023-11-29 05:13:03,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=178, Invalid=752, Unknown=0, NotChecked=0, Total=930 [2023-11-29 05:13:03,505 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 466 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:13:03,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1230 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 05:13:03,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3349 states. [2023-11-29 05:13:03,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3349 to 3023. [2023-11-29 05:13:03,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3023 states, 2828 states have (on average 1.17998585572843) internal successors, (3337), 2828 states have internal predecessors, (3337), 140 states have call successors, (140), 54 states have call predecessors, (140), 54 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2023-11-29 05:13:03,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3023 states to 3023 states and 3617 transitions. [2023-11-29 05:13:03,926 INFO L78 Accepts]: Start accepts. Automaton has 3023 states and 3617 transitions. Word has length 162 [2023-11-29 05:13:03,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:13:03,927 INFO L495 AbstractCegarLoop]: Abstraction has 3023 states and 3617 transitions. [2023-11-29 05:13:03,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:13:03,927 INFO L276 IsEmpty]: Start isEmpty. Operand 3023 states and 3617 transitions. [2023-11-29 05:13:03,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-29 05:13:03,928 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:13:03,928 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:13:03,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-11-29 05:13:03,929 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:13:03,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:13:03,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1832867056, now seen corresponding path program 1 times [2023-11-29 05:13:03,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:13:03,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550935462] [2023-11-29 05:13:03,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:13:03,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:13:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:05,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:13:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:05,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:13:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:05,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:13:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:05,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:13:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:05,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:13:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:05,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:13:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:05,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:13:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:05,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:13:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:05,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:13:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:05,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:13:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:05,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:13:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:05,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:13:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:05,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:13:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:05,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:13:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:05,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:13:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:05,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:13:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:05,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:13:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:05,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:13:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:05,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:13:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:05,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:13:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:05,230 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:13:05,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:13:05,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550935462] [2023-11-29 05:13:05,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550935462] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:13:05,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:13:05,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 05:13:05,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829157937] [2023-11-29 05:13:05,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:13:05,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 05:13:05,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:13:05,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 05:13:05,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:13:05,232 INFO L87 Difference]: Start difference. First operand 3023 states and 3617 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:13:06,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:13:06,607 INFO L93 Difference]: Finished difference Result 4762 states and 5687 transitions. [2023-11-29 05:13:06,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 05:13:06,608 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 162 [2023-11-29 05:13:06,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:13:06,611 INFO L225 Difference]: With dead ends: 4762 [2023-11-29 05:13:06,611 INFO L226 Difference]: Without dead ends: 3390 [2023-11-29 05:13:06,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2023-11-29 05:13:06,613 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 285 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:13:06,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 1082 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:13:06,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3390 states. [2023-11-29 05:13:07,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3390 to 3247. [2023-11-29 05:13:07,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3247 states, 3052 states have (on average 1.1831585845347312) internal successors, (3611), 3052 states have internal predecessors, (3611), 140 states have call successors, (140), 54 states have call predecessors, (140), 54 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2023-11-29 05:13:07,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3247 states to 3247 states and 3891 transitions. [2023-11-29 05:13:07,075 INFO L78 Accepts]: Start accepts. Automaton has 3247 states and 3891 transitions. Word has length 162 [2023-11-29 05:13:07,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:13:07,076 INFO L495 AbstractCegarLoop]: Abstraction has 3247 states and 3891 transitions. [2023-11-29 05:13:07,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:13:07,076 INFO L276 IsEmpty]: Start isEmpty. Operand 3247 states and 3891 transitions. [2023-11-29 05:13:07,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-29 05:13:07,078 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:13:07,079 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:13:07,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-11-29 05:13:07,079 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:13:07,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:13:07,079 INFO L85 PathProgramCache]: Analyzing trace with hash 12733747, now seen corresponding path program 1 times [2023-11-29 05:13:07,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:13:07,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170877251] [2023-11-29 05:13:07,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:13:07,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:13:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:07,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:13:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:07,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:13:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:07,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:13:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:07,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:13:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:07,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:13:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:07,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:13:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:07,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:13:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:07,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:13:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:07,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:13:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:07,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:13:07,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:07,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:13:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:07,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:13:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:07,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:13:07,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:07,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:13:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:07,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:13:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:07,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:13:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:07,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:13:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:07,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:13:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:07,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:13:07,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:07,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:13:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:07,557 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:13:07,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:13:07,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170877251] [2023-11-29 05:13:07,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170877251] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:13:07,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:13:07,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:13:07,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858273952] [2023-11-29 05:13:07,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:13:07,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:13:07,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:13:07,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:13:07,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:13:07,559 INFO L87 Difference]: Start difference. First operand 3247 states and 3891 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:13:08,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:13:08,667 INFO L93 Difference]: Finished difference Result 6193 states and 7384 transitions. [2023-11-29 05:13:08,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:13:08,668 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 162 [2023-11-29 05:13:08,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:13:08,671 INFO L225 Difference]: With dead ends: 6193 [2023-11-29 05:13:08,671 INFO L226 Difference]: Without dead ends: 3525 [2023-11-29 05:13:08,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:13:08,674 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 289 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:13:08,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 670 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:13:08,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3525 states. [2023-11-29 05:13:09,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3525 to 3311. [2023-11-29 05:13:09,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3311 states, 3116 states have (on average 1.1781129653401796) internal successors, (3671), 3116 states have internal predecessors, (3671), 140 states have call successors, (140), 54 states have call predecessors, (140), 54 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2023-11-29 05:13:09,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3311 states to 3311 states and 3951 transitions. [2023-11-29 05:13:09,130 INFO L78 Accepts]: Start accepts. Automaton has 3311 states and 3951 transitions. Word has length 162 [2023-11-29 05:13:09,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:13:09,130 INFO L495 AbstractCegarLoop]: Abstraction has 3311 states and 3951 transitions. [2023-11-29 05:13:09,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:13:09,130 INFO L276 IsEmpty]: Start isEmpty. Operand 3311 states and 3951 transitions. [2023-11-29 05:13:09,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-29 05:13:09,133 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:13:09,133 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:13:09,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-11-29 05:13:09,134 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:13:09,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:13:09,134 INFO L85 PathProgramCache]: Analyzing trace with hash -2070917814, now seen corresponding path program 1 times [2023-11-29 05:13:09,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:13:09,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808208922] [2023-11-29 05:13:09,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:13:09,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:13:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:09,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:13:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:09,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:13:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:09,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:13:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:09,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:13:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:09,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:13:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:09,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:13:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:09,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:13:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:09,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:13:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:09,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:13:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:09,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:13:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:09,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:13:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:09,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:13:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:09,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:13:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:09,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:13:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:09,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:13:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:09,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:13:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:09,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:13:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:09,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:13:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:09,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:13:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:09,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:13:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:09,770 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:13:09,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:13:09,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808208922] [2023-11-29 05:13:09,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808208922] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:13:09,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:13:09,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-29 05:13:09,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667379657] [2023-11-29 05:13:09,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:13:09,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 05:13:09,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:13:09,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 05:13:09,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:13:09,771 INFO L87 Difference]: Start difference. First operand 3311 states and 3951 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:13:11,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:13:11,182 INFO L93 Difference]: Finished difference Result 6766 states and 8035 transitions. [2023-11-29 05:13:11,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 05:13:11,183 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 162 [2023-11-29 05:13:11,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:13:11,186 INFO L225 Difference]: With dead ends: 6766 [2023-11-29 05:13:11,186 INFO L226 Difference]: Without dead ends: 5182 [2023-11-29 05:13:11,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2023-11-29 05:13:11,189 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 354 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:13:11,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 1680 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 05:13:11,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5182 states. [2023-11-29 05:13:11,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5182 to 3547. [2023-11-29 05:13:11,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3547 states, 3352 states have (on average 1.1763126491646778) internal successors, (3943), 3352 states have internal predecessors, (3943), 140 states have call successors, (140), 54 states have call predecessors, (140), 54 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2023-11-29 05:13:11,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3547 states to 3547 states and 4223 transitions. [2023-11-29 05:13:11,629 INFO L78 Accepts]: Start accepts. Automaton has 3547 states and 4223 transitions. Word has length 162 [2023-11-29 05:13:11,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:13:11,629 INFO L495 AbstractCegarLoop]: Abstraction has 3547 states and 4223 transitions. [2023-11-29 05:13:11,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:13:11,629 INFO L276 IsEmpty]: Start isEmpty. Operand 3547 states and 4223 transitions. [2023-11-29 05:13:11,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-29 05:13:11,631 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:13:11,631 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:13:11,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2023-11-29 05:13:11,632 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:13:11,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:13:11,632 INFO L85 PathProgramCache]: Analyzing trace with hash 229904776, now seen corresponding path program 1 times [2023-11-29 05:13:11,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:13:11,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976783503] [2023-11-29 05:13:11,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:13:11,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:13:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:15,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:13:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:15,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:13:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:15,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:13:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:15,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:13:15,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:15,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:13:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:15,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:13:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:16,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:13:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:16,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:13:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:16,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:13:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:16,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:13:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:16,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:13:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:16,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:13:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:16,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:13:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:16,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:13:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:16,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:13:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:16,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:13:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:16,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:13:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:16,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:13:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:16,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:13:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:16,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:13:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:16,112 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:13:16,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:13:16,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976783503] [2023-11-29 05:13:16,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976783503] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:13:16,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:13:16,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2023-11-29 05:13:16,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714799636] [2023-11-29 05:13:16,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:13:16,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 05:13:16,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:13:16,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 05:13:16,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2023-11-29 05:13:16,114 INFO L87 Difference]: Start difference. First operand 3547 states and 4223 transitions. Second operand has 26 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2023-11-29 05:13:22,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:13:22,789 INFO L93 Difference]: Finished difference Result 6945 states and 8128 transitions. [2023-11-29 05:13:22,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-29 05:13:22,790 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) Word has length 162 [2023-11-29 05:13:22,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:13:22,795 INFO L225 Difference]: With dead ends: 6945 [2023-11-29 05:13:22,795 INFO L226 Difference]: Without dead ends: 5243 [2023-11-29 05:13:22,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=721, Invalid=3061, Unknown=0, NotChecked=0, Total=3782 [2023-11-29 05:13:22,800 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 1446 mSDsluCounter, 2047 mSDsCounter, 0 mSdLazyCounter, 1855 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1446 SdHoareTripleChecker+Valid, 2178 SdHoareTripleChecker+Invalid, 2227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:13:22,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1446 Valid, 2178 Invalid, 2227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1855 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-29 05:13:22,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5243 states. [2023-11-29 05:13:23,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5243 to 3597. [2023-11-29 05:13:23,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3597 states, 3402 states have (on average 1.1766607877718989) internal successors, (4003), 3402 states have internal predecessors, (4003), 140 states have call successors, (140), 54 states have call predecessors, (140), 54 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2023-11-29 05:13:23,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 4283 transitions. [2023-11-29 05:13:23,282 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 4283 transitions. Word has length 162 [2023-11-29 05:13:23,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:13:23,283 INFO L495 AbstractCegarLoop]: Abstraction has 3597 states and 4283 transitions. [2023-11-29 05:13:23,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2023-11-29 05:13:23,283 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 4283 transitions. [2023-11-29 05:13:23,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-29 05:13:23,285 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:13:23,285 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:13:23,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2023-11-29 05:13:23,285 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:13:23,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:13:23,285 INFO L85 PathProgramCache]: Analyzing trace with hash 2004912138, now seen corresponding path program 1 times [2023-11-29 05:13:23,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:13:23,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477841554] [2023-11-29 05:13:23,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:13:23,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:13:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:24,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:13:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:24,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:13:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:24,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:13:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:24,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:13:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:24,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:13:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:24,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:13:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:24,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:13:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:24,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:13:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:24,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:13:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:24,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:13:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:24,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:13:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:24,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:13:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:24,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:13:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:24,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:13:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:24,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:13:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:24,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:13:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:24,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:13:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:24,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:13:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:24,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:13:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:24,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:13:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:24,212 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:13:24,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:13:24,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477841554] [2023-11-29 05:13:24,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477841554] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:13:24,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:13:24,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 05:13:24,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896451565] [2023-11-29 05:13:24,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:13:24,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:13:24,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:13:24,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:13:24,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:13:24,213 INFO L87 Difference]: Start difference. First operand 3597 states and 4283 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:13:25,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:13:25,288 INFO L93 Difference]: Finished difference Result 5432 states and 6455 transitions. [2023-11-29 05:13:25,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:13:25,289 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2023-11-29 05:13:25,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:13:25,293 INFO L225 Difference]: With dead ends: 5432 [2023-11-29 05:13:25,293 INFO L226 Difference]: Without dead ends: 3730 [2023-11-29 05:13:25,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:13:25,296 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 287 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:13:25,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 742 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:13:25,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3730 states. [2023-11-29 05:13:25,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3730 to 3537. [2023-11-29 05:13:25,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3537 states, 3342 states have (on average 1.1786355475763015) internal successors, (3939), 3342 states have internal predecessors, (3939), 140 states have call successors, (140), 54 states have call predecessors, (140), 54 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2023-11-29 05:13:25,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3537 states to 3537 states and 4219 transitions. [2023-11-29 05:13:25,767 INFO L78 Accepts]: Start accepts. Automaton has 3537 states and 4219 transitions. Word has length 162 [2023-11-29 05:13:25,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:13:25,767 INFO L495 AbstractCegarLoop]: Abstraction has 3537 states and 4219 transitions. [2023-11-29 05:13:25,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:13:25,767 INFO L276 IsEmpty]: Start isEmpty. Operand 3537 states and 4219 transitions. [2023-11-29 05:13:25,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-29 05:13:25,769 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:13:25,769 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:13:25,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2023-11-29 05:13:25,769 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:13:25,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:13:25,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1616108170, now seen corresponding path program 1 times [2023-11-29 05:13:25,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:13:25,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220303774] [2023-11-29 05:13:25,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:13:25,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:13:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:26,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:13:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:26,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:13:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:26,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:13:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:26,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:13:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:26,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:13:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:26,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:13:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:26,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:13:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:26,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:13:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:26,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:13:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:26,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:13:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:26,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:13:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:26,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:13:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:26,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:13:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:26,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:13:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:26,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:13:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:26,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:13:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:26,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:13:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:26,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:13:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:26,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:13:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:26,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:13:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:26,905 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:13:26,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:13:26,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220303774] [2023-11-29 05:13:26,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220303774] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:13:26,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:13:26,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-29 05:13:26,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848484741] [2023-11-29 05:13:26,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:13:26,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 05:13:26,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:13:26,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 05:13:26,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:13:26,907 INFO L87 Difference]: Start difference. First operand 3537 states and 4219 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-29 05:13:28,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:13:28,234 INFO L93 Difference]: Finished difference Result 5318 states and 6329 transitions. [2023-11-29 05:13:28,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:13:28,235 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 162 [2023-11-29 05:13:28,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:13:28,238 INFO L225 Difference]: With dead ends: 5318 [2023-11-29 05:13:28,238 INFO L226 Difference]: Without dead ends: 3646 [2023-11-29 05:13:28,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2023-11-29 05:13:28,240 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 311 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:13:28,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 957 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:13:28,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3646 states. [2023-11-29 05:13:28,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3646 to 3507. [2023-11-29 05:13:28,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3507 states, 3312 states have (on average 1.1796497584541064) internal successors, (3907), 3312 states have internal predecessors, (3907), 140 states have call successors, (140), 54 states have call predecessors, (140), 54 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2023-11-29 05:13:28,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3507 states to 3507 states and 4187 transitions. [2023-11-29 05:13:28,687 INFO L78 Accepts]: Start accepts. Automaton has 3507 states and 4187 transitions. Word has length 162 [2023-11-29 05:13:28,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:13:28,688 INFO L495 AbstractCegarLoop]: Abstraction has 3507 states and 4187 transitions. [2023-11-29 05:13:28,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-29 05:13:28,688 INFO L276 IsEmpty]: Start isEmpty. Operand 3507 states and 4187 transitions. [2023-11-29 05:13:28,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-29 05:13:28,690 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:13:28,690 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:13:28,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2023-11-29 05:13:28,690 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:13:28,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:13:28,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1981280680, now seen corresponding path program 1 times [2023-11-29 05:13:28,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:13:28,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246024659] [2023-11-29 05:13:28,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:13:28,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:13:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:29,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:13:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:29,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:13:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:29,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:13:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:29,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:13:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:29,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:13:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:29,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:13:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:29,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:13:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:29,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:13:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:29,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:13:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:29,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:13:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:29,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:13:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:29,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:13:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:29,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:13:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:29,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:13:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:29,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:13:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:29,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:13:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:29,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:13:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:29,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:13:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:29,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:13:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:29,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:13:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:29,139 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:13:29,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:13:29,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246024659] [2023-11-29 05:13:29,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246024659] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:13:29,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:13:29,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 05:13:29,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115526934] [2023-11-29 05:13:29,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:13:29,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:13:29,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:13:29,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:13:29,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:13:29,141 INFO L87 Difference]: Start difference. First operand 3507 states and 4187 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:13:30,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:13:30,082 INFO L93 Difference]: Finished difference Result 6433 states and 7662 transitions. [2023-11-29 05:13:30,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:13:30,083 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 163 [2023-11-29 05:13:30,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:13:30,086 INFO L225 Difference]: With dead ends: 6433 [2023-11-29 05:13:30,086 INFO L226 Difference]: Without dead ends: 4743 [2023-11-29 05:13:30,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2023-11-29 05:13:30,088 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 321 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:13:30,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 639 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:13:30,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4743 states. [2023-11-29 05:13:30,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4743 to 3737. [2023-11-29 05:13:30,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3737 states, 3542 states have (on average 1.1758893280632412) internal successors, (4165), 3542 states have internal predecessors, (4165), 140 states have call successors, (140), 54 states have call predecessors, (140), 54 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2023-11-29 05:13:30,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3737 states to 3737 states and 4445 transitions. [2023-11-29 05:13:30,531 INFO L78 Accepts]: Start accepts. Automaton has 3737 states and 4445 transitions. Word has length 163 [2023-11-29 05:13:30,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:13:30,532 INFO L495 AbstractCegarLoop]: Abstraction has 3737 states and 4445 transitions. [2023-11-29 05:13:30,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:13:30,532 INFO L276 IsEmpty]: Start isEmpty. Operand 3737 states and 4445 transitions. [2023-11-29 05:13:30,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-29 05:13:30,534 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:13:30,534 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:13:30,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2023-11-29 05:13:30,534 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:13:30,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:13:30,535 INFO L85 PathProgramCache]: Analyzing trace with hash 319541910, now seen corresponding path program 1 times [2023-11-29 05:13:30,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:13:30,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483359472] [2023-11-29 05:13:30,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:13:30,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:13:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:31,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:13:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:31,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:13:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:31,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:13:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:31,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:13:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:31,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:13:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:31,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:13:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:31,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:13:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:31,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:13:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:31,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:13:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:31,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:13:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:31,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:13:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:31,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:13:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:31,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:13:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:31,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:13:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:31,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:13:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:31,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:13:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:31,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:13:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:31,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:13:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:31,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:13:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:31,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:13:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:13:31,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:13:31,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483359472] [2023-11-29 05:13:31,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483359472] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:13:31,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:13:31,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:13:31,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39666482] [2023-11-29 05:13:31,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:13:31,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:13:31,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:13:31,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:13:31,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:13:31,277 INFO L87 Difference]: Start difference. First operand 3737 states and 4445 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:13:32,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:13:32,393 INFO L93 Difference]: Finished difference Result 6668 states and 7912 transitions. [2023-11-29 05:13:32,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:13:32,394 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 163 [2023-11-29 05:13:32,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:13:32,397 INFO L225 Difference]: With dead ends: 6668 [2023-11-29 05:13:32,397 INFO L226 Difference]: Without dead ends: 4802 [2023-11-29 05:13:32,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:13:32,399 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 361 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:13:32,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 610 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:13:32,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4802 states. [2023-11-29 05:13:32,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4802 to 3770. [2023-11-29 05:13:32,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3770 states, 3575 states have (on average 1.1633566433566433) internal successors, (4159), 3575 states have internal predecessors, (4159), 140 states have call successors, (140), 54 states have call predecessors, (140), 54 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2023-11-29 05:13:32,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3770 states to 3770 states and 4439 transitions. [2023-11-29 05:13:32,846 INFO L78 Accepts]: Start accepts. Automaton has 3770 states and 4439 transitions. Word has length 163 [2023-11-29 05:13:32,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:13:32,846 INFO L495 AbstractCegarLoop]: Abstraction has 3770 states and 4439 transitions. [2023-11-29 05:13:32,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 05:13:32,846 INFO L276 IsEmpty]: Start isEmpty. Operand 3770 states and 4439 transitions. [2023-11-29 05:13:32,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-29 05:13:32,849 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:13:32,849 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:13:32,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2023-11-29 05:13:32,849 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:13:32,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:13:32,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1557633958, now seen corresponding path program 1 times [2023-11-29 05:13:32,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:13:32,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870824900] [2023-11-29 05:13:32,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:13:32,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:13:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:33,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:13:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:33,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:13:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:33,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:13:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:33,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:13:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:33,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:13:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:33,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:13:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:33,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:13:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:33,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:13:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:33,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:13:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:33,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:13:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:33,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:13:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:33,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:13:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:33,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:13:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:33,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:13:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:33,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:13:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:33,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:13:33,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:33,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:13:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:33,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:13:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:33,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:13:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:33,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:13:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:33,789 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:13:33,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:13:33,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870824900] [2023-11-29 05:13:33,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870824900] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:13:33,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:13:33,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:13:33,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463484904] [2023-11-29 05:13:33,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:13:33,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:13:33,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:13:33,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:13:33,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:13:33,791 INFO L87 Difference]: Start difference. First operand 3770 states and 4439 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:13:35,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:13:35,069 INFO L93 Difference]: Finished difference Result 6415 states and 7530 transitions. [2023-11-29 05:13:35,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:13:35,070 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 163 [2023-11-29 05:13:35,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:13:35,073 INFO L225 Difference]: With dead ends: 6415 [2023-11-29 05:13:35,073 INFO L226 Difference]: Without dead ends: 4431 [2023-11-29 05:13:35,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:13:35,075 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 341 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:13:35,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 733 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:13:35,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4431 states. [2023-11-29 05:13:35,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4431 to 3592. [2023-11-29 05:13:35,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3592 states, 3397 states have (on average 1.1560200176626436) internal successors, (3927), 3397 states have internal predecessors, (3927), 140 states have call successors, (140), 54 states have call predecessors, (140), 54 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2023-11-29 05:13:35,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 4207 transitions. [2023-11-29 05:13:35,543 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 4207 transitions. Word has length 163 [2023-11-29 05:13:35,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:13:35,543 INFO L495 AbstractCegarLoop]: Abstraction has 3592 states and 4207 transitions. [2023-11-29 05:13:35,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:13:35,543 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 4207 transitions. [2023-11-29 05:13:35,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-29 05:13:35,545 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:13:35,545 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:13:35,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2023-11-29 05:13:35,546 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:13:35,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:13:35,546 INFO L85 PathProgramCache]: Analyzing trace with hash 743188632, now seen corresponding path program 1 times [2023-11-29 05:13:35,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:13:35,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532515353] [2023-11-29 05:13:35,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:13:35,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:13:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:35,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:13:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:35,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:13:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:35,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:13:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:35,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:13:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:35,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:13:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:35,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:13:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:35,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:13:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:35,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:13:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:35,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:13:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:35,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:13:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:35,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:13:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:35,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:13:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:35,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:13:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:35,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:13:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:35,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:13:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:35,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:13:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:35,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:13:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:35,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:13:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:35,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:13:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:35,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:13:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:35,982 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:13:35,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:13:35,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532515353] [2023-11-29 05:13:35,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532515353] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:13:35,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:13:35,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:13:35,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191210675] [2023-11-29 05:13:35,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:13:35,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:13:35,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:13:35,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:13:35,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:13:35,984 INFO L87 Difference]: Start difference. First operand 3592 states and 4207 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:13:36,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:13:36,879 INFO L93 Difference]: Finished difference Result 6274 states and 7296 transitions. [2023-11-29 05:13:36,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:13:36,880 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 163 [2023-11-29 05:13:36,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:13:36,884 INFO L225 Difference]: With dead ends: 6274 [2023-11-29 05:13:36,884 INFO L226 Difference]: Without dead ends: 4438 [2023-11-29 05:13:36,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:13:36,887 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 285 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:13:36,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 797 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:13:36,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4438 states. [2023-11-29 05:13:37,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4438 to 3716. [2023-11-29 05:13:37,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3716 states, 3521 states have (on average 1.1403010508378302) internal successors, (4015), 3521 states have internal predecessors, (4015), 140 states have call successors, (140), 54 states have call predecessors, (140), 54 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2023-11-29 05:13:37,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3716 states to 3716 states and 4295 transitions. [2023-11-29 05:13:37,350 INFO L78 Accepts]: Start accepts. Automaton has 3716 states and 4295 transitions. Word has length 163 [2023-11-29 05:13:37,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:13:37,350 INFO L495 AbstractCegarLoop]: Abstraction has 3716 states and 4295 transitions. [2023-11-29 05:13:37,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:13:37,350 INFO L276 IsEmpty]: Start isEmpty. Operand 3716 states and 4295 transitions. [2023-11-29 05:13:37,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-29 05:13:37,352 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:13:37,353 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:13:37,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2023-11-29 05:13:37,353 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:13:37,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:13:37,353 INFO L85 PathProgramCache]: Analyzing trace with hash -355178230, now seen corresponding path program 1 times [2023-11-29 05:13:37,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:13:37,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496933964] [2023-11-29 05:13:37,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:13:37,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:13:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:40,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:13:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:40,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:13:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:40,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:13:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:40,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:13:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:40,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:13:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:40,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:13:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:40,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:13:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:40,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:13:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:40,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:13:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:40,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:13:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:40,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:13:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:40,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:13:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:40,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:13:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:40,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:13:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:40,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:13:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:40,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:13:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:40,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:13:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:40,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:13:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:40,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:13:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:40,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:13:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:40,287 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 42 proven. 15 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-11-29 05:13:40,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:13:40,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496933964] [2023-11-29 05:13:40,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496933964] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:13:40,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839133387] [2023-11-29 05:13:40,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:13:40,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:13:40,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:13:40,289 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:13:40,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 05:13:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:40,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-29 05:13:40,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:13:41,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 05:13:42,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 43 [2023-11-29 05:13:42,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:13:42,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 05:13:42,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:13:42,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-11-29 05:13:42,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:13:42,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:13:42,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:13:42,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 40 [2023-11-29 05:13:43,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:13:43,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 65 [2023-11-29 05:13:43,409 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 336 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2023-11-29 05:13:43,409 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:13:46,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839133387] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:13:46,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:13:46,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11] total 27 [2023-11-29 05:13:46,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751995854] [2023-11-29 05:13:46,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:13:46,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-29 05:13:46,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:13:46,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 05:13:46,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2023-11-29 05:13:46,496 INFO L87 Difference]: Start difference. First operand 3716 states and 4295 transitions. Second operand has 27 states, 26 states have (on average 5.230769230769231) internal successors, (136), 26 states have internal predecessors, (136), 6 states have call successors, (40), 3 states have call predecessors, (40), 4 states have return successors, (40), 6 states have call predecessors, (40), 6 states have call successors, (40) [2023-11-29 05:13:55,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:13:55,199 INFO L93 Difference]: Finished difference Result 6755 states and 7779 transitions. [2023-11-29 05:13:55,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-29 05:13:55,199 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 5.230769230769231) internal successors, (136), 26 states have internal predecessors, (136), 6 states have call successors, (40), 3 states have call predecessors, (40), 4 states have return successors, (40), 6 states have call predecessors, (40), 6 states have call successors, (40) Word has length 165 [2023-11-29 05:13:55,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:13:55,204 INFO L225 Difference]: With dead ends: 6755 [2023-11-29 05:13:55,204 INFO L226 Difference]: Without dead ends: 4877 [2023-11-29 05:13:55,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 243 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=868, Invalid=4102, Unknown=0, NotChecked=0, Total=4970 [2023-11-29 05:13:55,207 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 1368 mSDsluCounter, 1637 mSDsCounter, 0 mSdLazyCounter, 2090 mSolverCounterSat, 435 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 1761 SdHoareTripleChecker+Invalid, 2526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 435 IncrementalHoareTripleChecker+Valid, 2090 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:13:55,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 1761 Invalid, 2526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [435 Valid, 2090 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2023-11-29 05:13:55,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4877 states. [2023-11-29 05:13:55,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4877 to 3253. [2023-11-29 05:13:55,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3253 states, 3073 states have (on average 1.135372600065083) internal successors, (3489), 3075 states have internal predecessors, (3489), 128 states have call successors, (128), 51 states have call predecessors, (128), 51 states have return successors, (128), 126 states have call predecessors, (128), 128 states have call successors, (128) [2023-11-29 05:13:55,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3253 states to 3253 states and 3745 transitions. [2023-11-29 05:13:55,697 INFO L78 Accepts]: Start accepts. Automaton has 3253 states and 3745 transitions. Word has length 165 [2023-11-29 05:13:55,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:13:55,697 INFO L495 AbstractCegarLoop]: Abstraction has 3253 states and 3745 transitions. [2023-11-29 05:13:55,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 5.230769230769231) internal successors, (136), 26 states have internal predecessors, (136), 6 states have call successors, (40), 3 states have call predecessors, (40), 4 states have return successors, (40), 6 states have call predecessors, (40), 6 states have call successors, (40) [2023-11-29 05:13:55,697 INFO L276 IsEmpty]: Start isEmpty. Operand 3253 states and 3745 transitions. [2023-11-29 05:13:55,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-29 05:13:55,700 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:13:55,700 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:13:55,706 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 05:13:55,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5deae79e-58ed-49cd-a5bb-80a51bdc5564/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:13:55,900 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:13:55,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:13:55,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1102775659, now seen corresponding path program 1 times [2023-11-29 05:13:55,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:13:55,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895279068] [2023-11-29 05:13:55,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:13:55,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:13:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:56,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:13:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:56,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:13:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:56,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:13:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:56,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:13:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:56,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:13:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:56,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:13:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:56,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:13:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:56,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:13:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:56,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:13:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:56,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:13:56,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:56,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:13:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:56,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:13:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:56,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:13:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:56,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:13:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:56,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:13:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:56,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:13:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:56,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:13:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:56,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:13:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:56,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:13:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:56,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:13:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:56,607 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:13:56,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:13:56,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895279068] [2023-11-29 05:13:56,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895279068] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:13:56,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:13:56,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 05:13:56,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060861861] [2023-11-29 05:13:56,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:13:56,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:13:56,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:13:56,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:13:56,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:13:56,608 INFO L87 Difference]: Start difference. First operand 3253 states and 3745 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:13:57,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:13:57,739 INFO L93 Difference]: Finished difference Result 3712 states and 4260 transitions. [2023-11-29 05:13:57,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 05:13:57,740 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 166 [2023-11-29 05:13:57,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:13:57,743 INFO L225 Difference]: With dead ends: 3712 [2023-11-29 05:13:57,743 INFO L226 Difference]: Without dead ends: 3710 [2023-11-29 05:13:57,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2023-11-29 05:13:57,744 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 437 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:13:57,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 777 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:13:57,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3710 states. [2023-11-29 05:13:58,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3710 to 3468. [2023-11-29 05:13:58,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3468 states, 3288 states have (on average 1.1347323600973236) internal successors, (3731), 3290 states have internal predecessors, (3731), 128 states have call successors, (128), 51 states have call predecessors, (128), 51 states have return successors, (128), 126 states have call predecessors, (128), 128 states have call successors, (128) [2023-11-29 05:13:58,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3468 states to 3468 states and 3987 transitions. [2023-11-29 05:13:58,214 INFO L78 Accepts]: Start accepts. Automaton has 3468 states and 3987 transitions. Word has length 166 [2023-11-29 05:13:58,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:13:58,215 INFO L495 AbstractCegarLoop]: Abstraction has 3468 states and 3987 transitions. [2023-11-29 05:13:58,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 05:13:58,215 INFO L276 IsEmpty]: Start isEmpty. Operand 3468 states and 3987 transitions. [2023-11-29 05:13:58,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-29 05:13:58,217 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:13:58,217 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:13:58,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2023-11-29 05:13:58,218 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:13:58,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:13:58,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1346824471, now seen corresponding path program 1 times [2023-11-29 05:13:58,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:13:58,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991479374] [2023-11-29 05:13:58,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:13:58,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:13:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:59,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:13:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:59,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:13:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:59,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:13:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:59,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:13:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:59,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:13:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:59,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:13:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:59,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:13:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:59,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:13:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:59,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:13:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:59,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:13:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:59,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:13:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:59,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:13:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:59,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:13:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:59,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 05:13:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:59,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:13:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:59,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:13:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:59,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:13:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:59,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:13:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:59,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:13:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:59,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:13:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:59,292 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 05:13:59,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:13:59,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991479374] [2023-11-29 05:13:59,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991479374] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:13:59,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:13:59,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 05:13:59,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824483173] [2023-11-29 05:13:59,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:13:59,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:13:59,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:13:59,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:13:59,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:13:59,294 INFO L87 Difference]: Start difference. First operand 3468 states and 3987 transitions. Second operand has 11 states, 10 states have (on average 6.9) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-29 05:14:00,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:14:00,844 INFO L93 Difference]: Finished difference Result 5961 states and 6833 transitions. [2023-11-29 05:14:00,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:14:00,845 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.9) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 166 [2023-11-29 05:14:00,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:14:00,845 INFO L225 Difference]: With dead ends: 5961 [2023-11-29 05:14:00,845 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 05:14:00,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2023-11-29 05:14:00,849 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 211 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:14:00,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 808 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 05:14:00,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 05:14:00,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 05:14:00,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:14:00,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 05:14:00,851 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 166 [2023-11-29 05:14:00,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:14:00,851 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 05:14:00,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.9) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-29 05:14:00,851 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 05:14:00,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 05:14:00,853 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 05:14:00,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2023-11-29 05:14:00,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.