./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-14.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_b31f75b6-0fde-46ec-9d9d-2bfa69ae1c48/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b31f75b6-0fde-46ec-9d9d-2bfa69ae1c48/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b31f75b6-0fde-46ec-9d9d-2bfa69ae1c48/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b31f75b6-0fde-46ec-9d9d-2bfa69ae1c48/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-14.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b31f75b6-0fde-46ec-9d9d-2bfa69ae1c48/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b31f75b6-0fde-46ec-9d9d-2bfa69ae1c48/bin/uautomizer-verify-VRDe98Ueme --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 57bda971cc74fc0d01c70e8ff55abb0ecbc2be19f4d9bb39359109904330c6bf --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:43:43,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:43:43,464 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b31f75b6-0fde-46ec-9d9d-2bfa69ae1c48/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 11:43:43,473 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:43:43,474 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:43:43,516 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:43:43,520 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:43:43,520 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:43:43,522 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:43:43,527 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:43:43,528 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:43:43,528 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:43:43,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:43:43,531 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:43:43,531 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:43:43,532 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:43:43,532 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:43:43,533 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:43:43,533 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:43:43,534 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:43:43,534 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:43:43,535 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:43:43,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:43:43,536 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:43:43,536 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:43:43,537 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:43:43,537 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:43:43,538 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:43:43,538 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:43:43,539 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:43:43,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:43:43,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:43:43,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:43:43,541 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:43:43,541 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:43:43,542 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:43:43,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:43:43,542 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:43:43,542 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:43:43,543 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:43:43,543 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:43:43,543 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:43:43,544 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_b31f75b6-0fde-46ec-9d9d-2bfa69ae1c48/bin/uautomizer-verify-VRDe98Ueme/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_b31f75b6-0fde-46ec-9d9d-2bfa69ae1c48/bin/uautomizer-verify-VRDe98Ueme 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 -> 57bda971cc74fc0d01c70e8ff55abb0ecbc2be19f4d9bb39359109904330c6bf [2023-11-26 11:43:43,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:43:43,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:43:43,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:43:43,921 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:43:43,921 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:43:43,923 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b31f75b6-0fde-46ec-9d9d-2bfa69ae1c48/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-14.i [2023-11-26 11:43:47,039 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:43:47,257 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:43:47,258 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b31f75b6-0fde-46ec-9d9d-2bfa69ae1c48/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-14.i [2023-11-26 11:43:47,268 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b31f75b6-0fde-46ec-9d9d-2bfa69ae1c48/bin/uautomizer-verify-VRDe98Ueme/data/566fbe74d/2755e88642ab4b4e83f898ca98c954d2/FLAGee46a8c60 [2023-11-26 11:43:47,284 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b31f75b6-0fde-46ec-9d9d-2bfa69ae1c48/bin/uautomizer-verify-VRDe98Ueme/data/566fbe74d/2755e88642ab4b4e83f898ca98c954d2 [2023-11-26 11:43:47,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:43:47,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:43:47,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:43:47,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:43:47,296 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:43:47,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:43:47" (1/1) ... [2023-11-26 11:43:47,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b4cd455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47, skipping insertion in model container [2023-11-26 11:43:47,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:43:47" (1/1) ... [2023-11-26 11:43:47,331 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:43:47,518 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_b31f75b6-0fde-46ec-9d9d-2bfa69ae1c48/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-14.i[917,930] [2023-11-26 11:43:47,646 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:43:47,729 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:43:47,782 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_b31f75b6-0fde-46ec-9d9d-2bfa69ae1c48/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-14.i[917,930] [2023-11-26 11:43:47,864 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:43:47,899 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:43:47,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47 WrapperNode [2023-11-26 11:43:47,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:43:47,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:43:47,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:43:47,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:43:47,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47" (1/1) ... [2023-11-26 11:43:47,944 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47" (1/1) ... [2023-11-26 11:43:48,006 INFO L138 Inliner]: procedures = 29, calls = 183, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 517 [2023-11-26 11:43:48,012 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:43:48,013 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:43:48,013 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:43:48,013 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:43:48,026 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47" (1/1) ... [2023-11-26 11:43:48,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47" (1/1) ... [2023-11-26 11:43:48,033 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47" (1/1) ... [2023-11-26 11:43:48,058 INFO L175 MemorySlicer]: Split 150 memory accesses to 2 slices as follows [2, 148]. 99 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 16]. The 20 writes are split as follows [0, 20]. [2023-11-26 11:43:48,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47" (1/1) ... [2023-11-26 11:43:48,058 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47" (1/1) ... [2023-11-26 11:43:48,078 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47" (1/1) ... [2023-11-26 11:43:48,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47" (1/1) ... [2023-11-26 11:43:48,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47" (1/1) ... [2023-11-26 11:43:48,090 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47" (1/1) ... [2023-11-26 11:43:48,095 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:43:48,097 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:43:48,097 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:43:48,097 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:43:48,098 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47" (1/1) ... [2023-11-26 11:43:48,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:43:48,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b31f75b6-0fde-46ec-9d9d-2bfa69ae1c48/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:43:48,149 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b31f75b6-0fde-46ec-9d9d-2bfa69ae1c48/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:43:48,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b31f75b6-0fde-46ec-9d9d-2bfa69ae1c48/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:43:48,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:43:48,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-11-26 11:43:48,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-11-26 11:43:48,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 11:43:48,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 11:43:48,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-11-26 11:43:48,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-11-26 11:43:48,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-26 11:43:48,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-26 11:43:48,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-11-26 11:43:48,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-11-26 11:43:48,206 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 11:43:48,206 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 11:43:48,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:43:48,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 11:43:48,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:43:48,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:43:48,402 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:43:48,405 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:43:49,037 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:43:49,112 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:43:49,112 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 11:43:49,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:43:49 BoogieIcfgContainer [2023-11-26 11:43:49,113 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:43:49,117 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:43:49,117 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:43:49,121 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:43:49,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:43:47" (1/3) ... [2023-11-26 11:43:49,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69eb4051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:43:49, skipping insertion in model container [2023-11-26 11:43:49,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47" (2/3) ... [2023-11-26 11:43:49,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69eb4051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:43:49, skipping insertion in model container [2023-11-26 11:43:49,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:43:49" (3/3) ... [2023-11-26 11:43:49,125 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-14.i [2023-11-26 11:43:49,147 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:43:49,147 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 11:43:49,204 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:43:49,211 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;@4e707f1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:43:49,211 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 11:43:49,217 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 97 states have (on average 1.4536082474226804) internal successors, (141), 98 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-26 11:43:49,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-26 11:43:49,235 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:43:49,236 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:43:49,236 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:43:49,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:43:49,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1045265753, now seen corresponding path program 1 times [2023-11-26 11:43:49,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:43:49,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459600747] [2023-11-26 11:43:49,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:49,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:43:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:43:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:43:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:43:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:43:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:43:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:43:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:43:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:43:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:43:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:43:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:43:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:43:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 11:43:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 11:43:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-26 11:43:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 11:43:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:43:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-26 11:43:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-26 11:43:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-26 11:43:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-26 11:43:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,847 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-26 11:43:49,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:43:49,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459600747] [2023-11-26 11:43:49,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459600747] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:43:49,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:43:49,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:43:49,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525413519] [2023-11-26 11:43:49,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:43:49,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:43:49,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:43:49,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:43:49,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:43:49,894 INFO L87 Difference]: Start difference. First operand has 121 states, 97 states have (on average 1.4536082474226804) internal successors, (141), 98 states have internal predecessors, (141), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-26 11:43:49,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:43:49,951 INFO L93 Difference]: Finished difference Result 239 states and 385 transitions. [2023-11-26 11:43:49,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:43:49,954 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 163 [2023-11-26 11:43:49,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:43:49,964 INFO L225 Difference]: With dead ends: 239 [2023-11-26 11:43:49,964 INFO L226 Difference]: Without dead ends: 119 [2023-11-26 11:43:49,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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-26 11:43:49,979 INFO L413 NwaCegarLoop]: 174 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, 174 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-26 11:43:49,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:43:50,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-26 11:43:50,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-11-26 11:43:50,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 96 states have (on average 1.4166666666666667) internal successors, (136), 96 states have internal predecessors, (136), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-26 11:43:50,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 178 transitions. [2023-11-26 11:43:50,085 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 178 transitions. Word has length 163 [2023-11-26 11:43:50,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:43:50,086 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 178 transitions. [2023-11-26 11:43:50,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-26 11:43:50,087 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 178 transitions. [2023-11-26 11:43:50,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-26 11:43:50,099 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:43:50,100 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:43:50,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:43:50,101 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:43:50,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:43:50,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1512887547, now seen corresponding path program 1 times [2023-11-26 11:43:50,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:43:50,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254159447] [2023-11-26 11:43:50,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:50,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:43:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:50,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:43:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:50,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:43:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:50,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:43:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:50,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:43:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:50,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:43:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:50,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:43:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:50,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:43:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:50,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:43:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:50,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:43:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:50,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:43:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:50,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:43:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:50,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:43:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:50,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 11:43:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:50,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 11:43:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:50,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-26 11:43:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:50,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 11:43:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:50,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:43:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:50,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-26 11:43:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:50,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-26 11:43:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:50,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-26 11:43:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:50,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-26 11:43:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-26 11:43:50,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:43:50,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254159447] [2023-11-26 11:43:50,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254159447] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:43:50,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:43:50,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:43:50,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877670382] [2023-11-26 11:43:50,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:43:50,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:43:50,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:43:50,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:43:50,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:43:50,877 INFO L87 Difference]: Start difference. First operand 119 states and 178 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-26 11:43:51,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:43:51,004 INFO L93 Difference]: Finished difference Result 241 states and 362 transitions. [2023-11-26 11:43:51,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:43:51,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2023-11-26 11:43:51,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:43:51,008 INFO L225 Difference]: With dead ends: 241 [2023-11-26 11:43:51,008 INFO L226 Difference]: Without dead ends: 123 [2023-11-26 11:43:51,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-26 11:43:51,011 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 3 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:43:51,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 506 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:43:51,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-26 11:43:51,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2023-11-26 11:43:51,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.404040404040404) internal successors, (139), 99 states have internal predecessors, (139), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-26 11:43:51,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 181 transitions. [2023-11-26 11:43:51,026 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 181 transitions. Word has length 163 [2023-11-26 11:43:51,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:43:51,029 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 181 transitions. [2023-11-26 11:43:51,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-26 11:43:51,029 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 181 transitions. [2023-11-26 11:43:51,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-26 11:43:51,032 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:43:51,033 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:43:51,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:43:51,033 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:43:51,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:43:51,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1093136007, now seen corresponding path program 1 times [2023-11-26 11:43:51,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:43:51,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990721778] [2023-11-26 11:43:51,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:51,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:43:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:51,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:43:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:51,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:43:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:51,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:43:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:51,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:43:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:51,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:43:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:51,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:43:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:51,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:43:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:51,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:43:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:51,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:43:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:51,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:43:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:51,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:43:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:51,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:43:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:51,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 11:43:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:51,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 11:43:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:51,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-26 11:43:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:51,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 11:43:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:51,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:43:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:51,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-26 11:43:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:51,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-26 11:43:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:51,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-26 11:43:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:51,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-26 11:43:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-26 11:43:51,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:43:51,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990721778] [2023-11-26 11:43:51,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990721778] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:43:51,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:43:51,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:43:51,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243667187] [2023-11-26 11:43:51,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:43:51,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:43:51,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:43:51,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:43:51,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:43:51,541 INFO L87 Difference]: Start difference. First operand 122 states and 181 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-26 11:43:51,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:43:51,906 INFO L93 Difference]: Finished difference Result 365 states and 542 transitions. [2023-11-26 11:43:51,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:43:51,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2023-11-26 11:43:51,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:43:51,911 INFO L225 Difference]: With dead ends: 365 [2023-11-26 11:43:51,911 INFO L226 Difference]: Without dead ends: 244 [2023-11-26 11:43:51,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-26 11:43:51,914 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 144 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 11:43:51,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 410 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 11:43:51,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2023-11-26 11:43:51,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 217. [2023-11-26 11:43:51,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 172 states have (on average 1.3837209302325582) internal successors, (238), 172 states have internal predecessors, (238), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-26 11:43:51,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 322 transitions. [2023-11-26 11:43:51,945 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 322 transitions. Word has length 163 [2023-11-26 11:43:51,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:43:51,946 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 322 transitions. [2023-11-26 11:43:51,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-26 11:43:51,947 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 322 transitions. [2023-11-26 11:43:51,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-26 11:43:51,949 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:43:51,949 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:43:51,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:43:51,950 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:43:51,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:43:51,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1396392955, now seen corresponding path program 1 times [2023-11-26 11:43:51,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:43:51,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894436276] [2023-11-26 11:43:51,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:51,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:43:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:52,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:43:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:52,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:43:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:52,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:43:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:52,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:43:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:52,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:43:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:52,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:43:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:52,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:43:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:52,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:43:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:52,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:43:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:52,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:43:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:52,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:43:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:52,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:43:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:52,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 11:43:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:52,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 11:43:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:52,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-26 11:43:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:52,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 11:43:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:52,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:43:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:52,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-26 11:43:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:52,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-26 11:43:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:52,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-26 11:43:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:52,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-26 11:43:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:52,790 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-26 11:43:52,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:43:52,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894436276] [2023-11-26 11:43:52,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894436276] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:43:52,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:43:52,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:43:52,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010968204] [2023-11-26 11:43:52,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:43:52,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:43:52,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:43:52,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:43:52,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:43:52,794 INFO L87 Difference]: Start difference. First operand 217 states and 322 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-26 11:43:53,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:43:53,100 INFO L93 Difference]: Finished difference Result 385 states and 572 transitions. [2023-11-26 11:43:53,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:43:53,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2023-11-26 11:43:53,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:43:53,105 INFO L225 Difference]: With dead ends: 385 [2023-11-26 11:43:53,105 INFO L226 Difference]: Without dead ends: 258 [2023-11-26 11:43:53,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:43:53,107 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 52 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 11:43:53,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 637 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 11:43:53,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2023-11-26 11:43:53,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 219. [2023-11-26 11:43:53,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 174 states have (on average 1.3793103448275863) internal successors, (240), 174 states have internal predecessors, (240), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-26 11:43:53,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 324 transitions. [2023-11-26 11:43:53,138 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 324 transitions. Word has length 163 [2023-11-26 11:43:53,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:43:53,139 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 324 transitions. [2023-11-26 11:43:53,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-26 11:43:53,140 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 324 transitions. [2023-11-26 11:43:53,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-26 11:43:53,142 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:43:53,142 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:43:53,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:43:53,143 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:43:53,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:43:53,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1983198969, now seen corresponding path program 1 times [2023-11-26 11:43:53,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:43:53,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423586267] [2023-11-26 11:43:53,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:53,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:43:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:53,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:43:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:53,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:43:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:53,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:43:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:53,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:43:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:53,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:43:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:53,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:43:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:53,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:43:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:53,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:43:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:53,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:43:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:53,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:43:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:53,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:43:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:53,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:43:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:53,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 11:43:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:53,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 11:43:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:53,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-26 11:43:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:53,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 11:43:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:53,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:43:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:53,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-26 11:43:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:53,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-26 11:43:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:53,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-26 11:43:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:53,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-26 11:43:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:53,978 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-26 11:43:53,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:43:53,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423586267] [2023-11-26 11:43:53,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423586267] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:43:53,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:43:53,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:43:53,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721425944] [2023-11-26 11:43:53,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:43:53,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:43:53,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:43:53,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:43:53,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:43:53,983 INFO L87 Difference]: Start difference. First operand 219 states and 324 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-26 11:43:54,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:43:54,472 INFO L93 Difference]: Finished difference Result 408 states and 604 transitions. [2023-11-26 11:43:54,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 11:43:54,473 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2023-11-26 11:43:54,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:43:54,476 INFO L225 Difference]: With dead ends: 408 [2023-11-26 11:43:54,476 INFO L226 Difference]: Without dead ends: 286 [2023-11-26 11:43:54,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-26 11:43:54,478 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 243 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 11:43:54,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 614 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-26 11:43:54,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-11-26 11:43:54,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 229. [2023-11-26 11:43:54,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 184 states have (on average 1.3804347826086956) internal successors, (254), 184 states have internal predecessors, (254), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-26 11:43:54,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 338 transitions. [2023-11-26 11:43:54,525 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 338 transitions. Word has length 163 [2023-11-26 11:43:54,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:43:54,527 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 338 transitions. [2023-11-26 11:43:54,527 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-26 11:43:54,528 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 338 transitions. [2023-11-26 11:43:54,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-11-26 11:43:54,530 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:43:54,530 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:43:54,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:43:54,531 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:43:54,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:43:54,531 INFO L85 PathProgramCache]: Analyzing trace with hash 385275705, now seen corresponding path program 1 times [2023-11-26 11:43:54,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:43:54,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292846201] [2023-11-26 11:43:54,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:54,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:43:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:55,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:43:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:55,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:43:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:55,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:43:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:55,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:43:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:55,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:43:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:55,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:43:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:55,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:43:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:55,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:43:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:55,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:43:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:55,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:43:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:55,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:43:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:55,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:43:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:55,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 11:43:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:55,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 11:43:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:55,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-26 11:43:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:55,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 11:43:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:55,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:43:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:55,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-26 11:43:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:55,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-26 11:43:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:55,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-26 11:43:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:55,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-26 11:43:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:55,458 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-26 11:43:55,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:43:55,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292846201] [2023-11-26 11:43:55,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292846201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:43:55,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:43:55,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:43:55,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055453294] [2023-11-26 11:43:55,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:43:55,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:43:55,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:43:55,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:43:55,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:43:55,461 INFO L87 Difference]: Start difference. First operand 229 states and 338 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-26 11:43:55,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:43:55,836 INFO L93 Difference]: Finished difference Result 421 states and 617 transitions. [2023-11-26 11:43:55,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:43:55,837 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2023-11-26 11:43:55,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:43:55,840 INFO L225 Difference]: With dead ends: 421 [2023-11-26 11:43:55,840 INFO L226 Difference]: Without dead ends: 288 [2023-11-26 11:43:55,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:43:55,842 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 82 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 11:43:55,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 783 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 11:43:55,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2023-11-26 11:43:55,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 225. [2023-11-26 11:43:55,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 180 states have (on average 1.3555555555555556) internal successors, (244), 180 states have internal predecessors, (244), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-26 11:43:55,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 328 transitions. [2023-11-26 11:43:55,873 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 328 transitions. Word has length 163 [2023-11-26 11:43:55,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:43:55,874 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 328 transitions. [2023-11-26 11:43:55,874 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-26 11:43:55,875 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 328 transitions. [2023-11-26 11:43:55,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-26 11:43:55,878 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:43:55,878 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:43:55,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:43:55,879 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:43:55,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:43:55,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1081671008, now seen corresponding path program 1 times [2023-11-26 11:43:55,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:43:55,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423236032] [2023-11-26 11:43:55,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:55,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:43:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:58,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:43:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:58,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:43:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:58,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:43:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:58,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:43:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:58,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:43:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:58,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:43:58,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:58,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:43:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:58,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:43:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:58,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:43:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:58,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:43:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:58,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:43:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:59,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:43:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:59,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 11:43:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:59,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 11:43:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:59,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-26 11:43:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:59,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 11:43:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:59,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:43:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:59,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-26 11:43:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:59,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-26 11:43:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:59,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-26 11:43:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:59,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-26 11:43:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:59,107 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-11-26 11:43:59,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:43:59,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423236032] [2023-11-26 11:43:59,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423236032] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:43:59,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544421397] [2023-11-26 11:43:59,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:59,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:43:59,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b31f75b6-0fde-46ec-9d9d-2bfa69ae1c48/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:43:59,115 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b31f75b6-0fde-46ec-9d9d-2bfa69ae1c48/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:43:59,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b31f75b6-0fde-46ec-9d9d-2bfa69ae1c48/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 11:43:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:59,431 INFO L262 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-26 11:43:59,461 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:44:01,644 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-26 11:44:02,265 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-26 11:44:02,701 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-26 11:44:03,015 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-26 11:44:03,531 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-26 11:44:03,885 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-26 11:44:04,171 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-26 11:44:04,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:44:04,551 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-26 11:44:04,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:44:04,623 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-26 11:44:04,708 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-11-26 11:44:04,708 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 1 case distinctions, treesize of input 21 treesize of output 28 [2023-11-26 11:44:04,809 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 358 proven. 176 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2023-11-26 11:44:04,809 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:44:05,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544421397] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:44:05,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-26 11:44:05,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2023-11-26 11:44:05,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570901447] [2023-11-26 11:44:05,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-26 11:44:05,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-26 11:44:05,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:05,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-26 11:44:05,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2023-11-26 11:44:05,054 INFO L87 Difference]: Start difference. First operand 225 states and 328 transitions. Second operand has 24 states, 21 states have (on average 5.809523809523809) internal successors, (122), 24 states have internal predecessors, (122), 10 states have call successors, (42), 4 states have call predecessors, (42), 6 states have return successors, (42), 7 states have call predecessors, (42), 10 states have call successors, (42) [2023-11-26 11:44:08,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:44:08,417 INFO L93 Difference]: Finished difference Result 586 states and 834 transitions. [2023-11-26 11:44:08,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-26 11:44:08,418 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 5.809523809523809) internal successors, (122), 24 states have internal predecessors, (122), 10 states have call successors, (42), 4 states have call predecessors, (42), 6 states have return successors, (42), 7 states have call predecessors, (42), 10 states have call successors, (42) Word has length 165 [2023-11-26 11:44:08,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:44:08,422 INFO L225 Difference]: With dead ends: 586 [2023-11-26 11:44:08,422 INFO L226 Difference]: Without dead ends: 453 [2023-11-26 11:44:08,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 227 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=439, Invalid=2213, Unknown=0, NotChecked=0, Total=2652 [2023-11-26 11:44:08,425 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 819 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 1581 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 1823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 1581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:44:08,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 778 Invalid, 1823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 1581 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-26 11:44:08,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2023-11-26 11:44:08,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 338. [2023-11-26 11:44:08,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 268 states have (on average 1.3208955223880596) internal successors, (354), 269 states have internal predecessors, (354), 63 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2023-11-26 11:44:08,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 480 transitions. [2023-11-26 11:44:08,474 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 480 transitions. Word has length 165 [2023-11-26 11:44:08,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:44:08,475 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 480 transitions. [2023-11-26 11:44:08,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 5.809523809523809) internal successors, (122), 24 states have internal predecessors, (122), 10 states have call successors, (42), 4 states have call predecessors, (42), 6 states have return successors, (42), 7 states have call predecessors, (42), 10 states have call successors, (42) [2023-11-26 11:44:08,475 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 480 transitions. [2023-11-26 11:44:08,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-26 11:44:08,477 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:44:08,478 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:44:08,495 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b31f75b6-0fde-46ec-9d9d-2bfa69ae1c48/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-26 11:44:08,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b31f75b6-0fde-46ec-9d9d-2bfa69ae1c48/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-26 11:44:08,695 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:44:08,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:08,696 INFO L85 PathProgramCache]: Analyzing trace with hash 583723680, now seen corresponding path program 1 times [2023-11-26 11:44:08,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:08,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682100300] [2023-11-26 11:44:08,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:08,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:14,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:44:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:14,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:44:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:14,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:44:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:14,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:44:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:14,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:44:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:14,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:44:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:14,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:44:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:14,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:44:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:14,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:44:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:14,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:44:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:14,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:44:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:14,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:44:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:14,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 11:44:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:14,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 11:44:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:14,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-26 11:44:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:14,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 11:44:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:14,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:44:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:14,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-26 11:44:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:14,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-26 11:44:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:14,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-26 11:44:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:14,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-26 11:44:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:14,431 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-26 11:44:14,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:14,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682100300] [2023-11-26 11:44:14,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682100300] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:44:14,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:44:14,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-26 11:44:14,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905954397] [2023-11-26 11:44:14,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:44:14,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-26 11:44:14,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:14,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-26 11:44:14,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-26 11:44:14,434 INFO L87 Difference]: Start difference. First operand 338 states and 480 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-26 11:44:18,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:44:18,384 INFO L93 Difference]: Finished difference Result 768 states and 1080 transitions. [2023-11-26 11:44:18,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-26 11:44:18,384 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 165 [2023-11-26 11:44:18,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:44:18,390 INFO L225 Difference]: With dead ends: 768 [2023-11-26 11:44:18,390 INFO L226 Difference]: Without dead ends: 501 [2023-11-26 11:44:18,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=200, Invalid=556, Unknown=0, NotChecked=0, Total=756 [2023-11-26 11:44:18,392 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 901 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-26 11:44:18,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 814 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-26 11:44:18,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2023-11-26 11:44:18,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 380. [2023-11-26 11:44:18,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 310 states have (on average 1.3161290322580645) internal successors, (408), 311 states have internal predecessors, (408), 63 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2023-11-26 11:44:18,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 534 transitions. [2023-11-26 11:44:18,463 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 534 transitions. Word has length 165 [2023-11-26 11:44:18,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:44:18,464 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 534 transitions. [2023-11-26 11:44:18,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-26 11:44:18,465 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 534 transitions. [2023-11-26 11:44:18,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-26 11:44:18,467 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:44:18,467 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:44:18,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 11:44:18,468 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:44:18,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:18,468 INFO L85 PathProgramCache]: Analyzing trace with hash 2123473950, now seen corresponding path program 1 times [2023-11-26 11:44:18,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:18,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69433023] [2023-11-26 11:44:18,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:18,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:18,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:44:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:18,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:44:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:18,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:44:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:18,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:44:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:18,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:44:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:18,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:44:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:18,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:44:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:18,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:44:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:18,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:44:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:18,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:44:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:18,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:44:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:18,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:44:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:18,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 11:44:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:18,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 11:44:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:18,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-26 11:44:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:18,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 11:44:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:18,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:44:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:18,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-26 11:44:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:18,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-26 11:44:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:18,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-26 11:44:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:18,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-26 11:44:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:18,941 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-26 11:44:18,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:18,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69433023] [2023-11-26 11:44:18,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69433023] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:44:18,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:44:18,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:44:18,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851451049] [2023-11-26 11:44:18,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:44:18,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:44:18,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:18,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:44:18,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:44:18,945 INFO L87 Difference]: Start difference. First operand 380 states and 534 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-26 11:44:19,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:44:19,192 INFO L93 Difference]: Finished difference Result 619 states and 859 transitions. [2023-11-26 11:44:19,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:44:19,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 167 [2023-11-26 11:44:19,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:44:19,200 INFO L225 Difference]: With dead ends: 619 [2023-11-26 11:44:19,200 INFO L226 Difference]: Without dead ends: 450 [2023-11-26 11:44:19,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 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-26 11:44:19,204 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 47 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 11:44:19,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 624 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 11:44:19,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2023-11-26 11:44:19,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 388. [2023-11-26 11:44:19,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 318 states have (on average 1.3081761006289307) internal successors, (416), 319 states have internal predecessors, (416), 63 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2023-11-26 11:44:19,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 542 transitions. [2023-11-26 11:44:19,284 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 542 transitions. Word has length 167 [2023-11-26 11:44:19,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:44:19,286 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 542 transitions. [2023-11-26 11:44:19,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-26 11:44:19,287 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 542 transitions. [2023-11-26 11:44:19,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-26 11:44:19,289 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:44:19,290 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:44:19,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 11:44:19,290 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:44:19,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:19,291 INFO L85 PathProgramCache]: Analyzing trace with hash -506098658, now seen corresponding path program 1 times [2023-11-26 11:44:19,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:19,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157636799] [2023-11-26 11:44:19,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:19,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:24,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:44:24,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:24,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:44:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:24,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:44:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:24,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:44:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:24,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:44:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:24,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:44:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:24,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:44:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:24,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:44:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:24,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:44:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:24,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:44:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:24,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:44:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:24,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:44:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:24,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-26 11:44:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:24,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 11:44:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:24,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-26 11:44:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:24,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-26 11:44:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:24,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:44:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:24,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-26 11:44:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:24,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-26 11:44:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:24,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-26 11:44:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:24,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-26 11:44:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:24,759 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-26 11:44:24,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:24,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157636799] [2023-11-26 11:44:24,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157636799] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:44:24,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:44:24,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-26 11:44:24,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569682353] [2023-11-26 11:44:24,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:44:24,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-26 11:44:24,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:24,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-26 11:44:24,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-26 11:44:24,762 INFO L87 Difference]: Start difference. First operand 388 states and 542 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-26 11:44:26,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:44:26,949 INFO L93 Difference]: Finished difference Result 652 states and 908 transitions. [2023-11-26 11:44:26,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-26 11:44:26,950 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), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 167 [2023-11-26 11:44:26,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:44:26,966 INFO L225 Difference]: With dead ends: 652 [2023-11-26 11:44:26,966 INFO L226 Difference]: Without dead ends: 489 [2023-11-26 11:44:26,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2023-11-26 11:44:26,968 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 387 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-26 11:44:26,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 594 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-26 11:44:26,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2023-11-26 11:44:27,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 379. [2023-11-26 11:44:27,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 309 states have (on average 1.3106796116504855) internal successors, (405), 310 states have internal predecessors, (405), 63 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2023-11-26 11:44:27,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 531 transitions. [2023-11-26 11:44:27,051 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 531 transitions. Word has length 167 [2023-11-26 11:44:27,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:44:27,051 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 531 transitions. [2023-11-26 11:44:27,052 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), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-26 11:44:27,052 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 531 transitions. [2023-11-26 11:44:27,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-26 11:44:27,054 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:44:27,055 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:44:27,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 11:44:27,055 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:44:27,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:27,055 INFO L85 PathProgramCache]: Analyzing trace with hash 434530208, now seen corresponding path program 1 times [2023-11-26 11:44:27,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:27,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445896028] [2023-11-26 11:44:27,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:27,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat