./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d32940e-2dd0-4363-a167-a273f3b50d8a/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d32940e-2dd0-4363-a167-a273f3b50d8a/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d32940e-2dd0-4363-a167-a273f3b50d8a/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d32940e-2dd0-4363-a167-a273f3b50d8a/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-66.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d32940e-2dd0-4363-a167-a273f3b50d8a/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d32940e-2dd0-4363-a167-a273f3b50d8a/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2463f96020283dc976a48e4624a0a64ed4b926874e2dafad9e507fb796d4e148 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:35:57,632 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:35:57,694 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d32940e-2dd0-4363-a167-a273f3b50d8a/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-28 20:35:57,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:35:57,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:35:57,722 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:35:57,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:35:57,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:35:57,724 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:35:57,725 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:35:57,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:35:57,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:35:57,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:35:57,727 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:35:57,728 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:35:57,728 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:35:57,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:35:57,729 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:35:57,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:35:57,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:35:57,731 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:35:57,731 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:35:57,732 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:35:57,732 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:35:57,733 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:35:57,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:35:57,734 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:35:57,734 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:35:57,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:35:57,735 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:35:57,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:35:57,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:35:57,737 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:35:57,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:35:57,737 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:35:57,737 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 20:35:57,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 20:35:57,738 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:35:57,738 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:35:57,738 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:35:57,738 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:35:57,739 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:35:57,739 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_0d32940e-2dd0-4363-a167-a273f3b50d8a/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d32940e-2dd0-4363-a167-a273f3b50d8a/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2463f96020283dc976a48e4624a0a64ed4b926874e2dafad9e507fb796d4e148 [2023-11-28 20:35:57,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:35:57,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:35:57,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:35:57,980 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:35:57,981 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:35:57,982 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d32940e-2dd0-4363-a167-a273f3b50d8a/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-66.i [2023-11-28 20:36:00,867 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:36:01,048 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:36:01,049 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d32940e-2dd0-4363-a167-a273f3b50d8a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-66.i [2023-11-28 20:36:01,059 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d32940e-2dd0-4363-a167-a273f3b50d8a/bin/uautomizer-verify-BQ2R08f2Ya/data/1ef4ffd89/1b1f37480ec44529beb2368e8c766848/FLAG575186a86 [2023-11-28 20:36:01,075 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d32940e-2dd0-4363-a167-a273f3b50d8a/bin/uautomizer-verify-BQ2R08f2Ya/data/1ef4ffd89/1b1f37480ec44529beb2368e8c766848 [2023-11-28 20:36:01,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:36:01,080 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:36:01,081 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:36:01,081 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:36:01,086 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:36:01,087 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:36:01" (1/1) ... [2023-11-28 20:36:01,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59366184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:01, skipping insertion in model container [2023-11-28 20:36:01,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:36:01" (1/1) ... [2023-11-28 20:36:01,113 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:36:01,237 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_0d32940e-2dd0-4363-a167-a273f3b50d8a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-66.i[913,926] [2023-11-28 20:36:01,280 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:36:01,290 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:36:01,301 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_0d32940e-2dd0-4363-a167-a273f3b50d8a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-66.i[913,926] [2023-11-28 20:36:01,323 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:36:01,337 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:36:01,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:01 WrapperNode [2023-11-28 20:36:01,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:36:01,338 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:36:01,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:36:01,339 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:36:01,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:01" (1/1) ... [2023-11-28 20:36:01,353 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:01" (1/1) ... [2023-11-28 20:36:01,388 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2023-11-28 20:36:01,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:36:01,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:36:01,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:36:01,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:36:01,398 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:01" (1/1) ... [2023-11-28 20:36:01,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:01" (1/1) ... [2023-11-28 20:36:01,401 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:01" (1/1) ... [2023-11-28 20:36:01,419 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-28 20:36:01,419 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:01" (1/1) ... [2023-11-28 20:36:01,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:01" (1/1) ... [2023-11-28 20:36:01,427 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:01" (1/1) ... [2023-11-28 20:36:01,430 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:01" (1/1) ... [2023-11-28 20:36:01,432 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:01" (1/1) ... [2023-11-28 20:36:01,434 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:01" (1/1) ... [2023-11-28 20:36:01,439 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:36:01,440 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:36:01,440 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:36:01,440 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:36:01,441 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:01" (1/1) ... [2023-11-28 20:36:01,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:36:01,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d32940e-2dd0-4363-a167-a273f3b50d8a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:36:01,467 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d32940e-2dd0-4363-a167-a273f3b50d8a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:36:01,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d32940e-2dd0-4363-a167-a273f3b50d8a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:36:01,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:36:01,501 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-28 20:36:01,501 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-28 20:36:01,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 20:36:01,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:36:01,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:36:01,573 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:36:01,575 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:36:01,855 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:36:01,891 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:36:01,891 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-28 20:36:01,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:36:01 BoogieIcfgContainer [2023-11-28 20:36:01,892 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:36:01,895 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:36:01,895 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:36:01,899 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:36:01,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:36:01" (1/3) ... [2023-11-28 20:36:01,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ce92e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:36:01, skipping insertion in model container [2023-11-28 20:36:01,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:01" (2/3) ... [2023-11-28 20:36:01,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ce92e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:36:01, skipping insertion in model container [2023-11-28 20:36:01,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:36:01" (3/3) ... [2023-11-28 20:36:01,902 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-66.i [2023-11-28 20:36:01,922 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:36:01,922 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 20:36:01,965 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:36:01,972 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;@703e0c84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:36:01,973 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-28 20:36:01,977 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-28 20:36:01,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-28 20:36:01,989 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:01,990 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:36:01,991 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:01,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:01,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1944780512, now seen corresponding path program 1 times [2023-11-28 20:36:02,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:02,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257296622] [2023-11-28 20:36:02,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:02,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:02,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:36:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:02,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:36:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:02,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:36:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:02,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:36:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:02,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:36:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:02,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:36:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:02,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:36:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:02,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:36:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:02,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:36:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:02,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:36:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:02,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:36:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:02,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:36:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:02,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:36:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:02,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:36:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:02,302 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-28 20:36:02,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:02,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257296622] [2023-11-28 20:36:02,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257296622] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:02,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:02,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:36:02,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400542599] [2023-11-28 20:36:02,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:02,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-28 20:36:02,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:02,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-28 20:36:02,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 20:36:02,348 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-28 20:36:02,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:02,392 INFO L93 Difference]: Finished difference Result 75 states and 132 transitions. [2023-11-28 20:36:02,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-28 20:36:02,395 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 85 [2023-11-28 20:36:02,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:02,401 INFO L225 Difference]: With dead ends: 75 [2023-11-28 20:36:02,402 INFO L226 Difference]: Without dead ends: 37 [2023-11-28 20:36:02,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-28 20:36:02,408 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:02,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:36:02,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-28 20:36:02,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-28 20:36:02,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-28 20:36:02,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2023-11-28 20:36:02,448 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 85 [2023-11-28 20:36:02,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:02,449 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2023-11-28 20:36:02,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-28 20:36:02,449 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2023-11-28 20:36:02,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-28 20:36:02,453 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:02,454 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:36:02,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 20:36:02,454 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:02,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:02,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1661919200, now seen corresponding path program 1 times [2023-11-28 20:36:02,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:02,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108346577] [2023-11-28 20:36:02,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:02,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:02,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:36:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:02,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:36:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:02,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:36:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:02,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:36:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:02,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:36:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:02,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:36:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:02,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:36:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:02,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:36:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:02,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:36:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:02,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:36:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:02,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:36:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:02,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:36:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:02,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:36:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:02,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:36:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:02,883 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-28 20:36:02,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:02,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108346577] [2023-11-28 20:36:02,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108346577] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:02,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:02,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:36:02,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352171450] [2023-11-28 20:36:02,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:02,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:36:02,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:02,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:36:02,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:36:02,889 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-28 20:36:02,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:02,941 INFO L93 Difference]: Finished difference Result 109 states and 163 transitions. [2023-11-28 20:36:02,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:36:02,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 85 [2023-11-28 20:36:02,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:02,945 INFO L225 Difference]: With dead ends: 109 [2023-11-28 20:36:02,945 INFO L226 Difference]: Without dead ends: 73 [2023-11-28 20:36:02,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:36:02,948 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 26 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:02,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 94 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:36:02,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-28 20:36:02,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2023-11-28 20:36:02,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-28 20:36:02,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 104 transitions. [2023-11-28 20:36:02,973 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 104 transitions. Word has length 85 [2023-11-28 20:36:02,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:02,974 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 104 transitions. [2023-11-28 20:36:02,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-28 20:36:02,974 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 104 transitions. [2023-11-28 20:36:02,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-28 20:36:02,976 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:02,977 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:36:02,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 20:36:02,977 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:02,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:02,978 INFO L85 PathProgramCache]: Analyzing trace with hash -20088315, now seen corresponding path program 1 times [2023-11-28 20:36:02,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:02,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411176628] [2023-11-28 20:36:02,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:02,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:03,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:36:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:03,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:36:03,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:03,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:36:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:03,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:36:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:03,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:36:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:03,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:36:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:03,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:36:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:03,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:36:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:03,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:36:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:03,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:36:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:03,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:36:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:03,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:36:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:03,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:36:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:03,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:36:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:03,510 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-28 20:36:03,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:03,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411176628] [2023-11-28 20:36:03,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411176628] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:03,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:03,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:36:03,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79429363] [2023-11-28 20:36:03,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:03,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:36:03,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:03,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:36:03,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:36:03,514 INFO L87 Difference]: Start difference. First operand 70 states and 104 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-28 20:36:03,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:03,736 INFO L93 Difference]: Finished difference Result 183 states and 271 transitions. [2023-11-28 20:36:03,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 20:36:03,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 86 [2023-11-28 20:36:03,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:03,739 INFO L225 Difference]: With dead ends: 183 [2023-11-28 20:36:03,740 INFO L226 Difference]: Without dead ends: 114 [2023-11-28 20:36:03,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:36:03,742 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 68 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:03,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 162 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 20:36:03,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-11-28 20:36:03,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 104. [2023-11-28 20:36:03,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-28 20:36:03,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 155 transitions. [2023-11-28 20:36:03,775 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 155 transitions. Word has length 86 [2023-11-28 20:36:03,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:03,776 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 155 transitions. [2023-11-28 20:36:03,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-28 20:36:03,776 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 155 transitions. [2023-11-28 20:36:03,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-28 20:36:03,778 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:03,778 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:36:03,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 20:36:03,779 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:03,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:03,779 INFO L85 PathProgramCache]: Analyzing trace with hash -20147897, now seen corresponding path program 1 times [2023-11-28 20:36:03,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:03,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579762588] [2023-11-28 20:36:03,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:03,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:08,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:36:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:08,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:36:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:08,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:36:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:08,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:36:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:08,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:36:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:08,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:36:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:08,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:36:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:08,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:36:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:08,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:36:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:08,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:36:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:08,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:36:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:08,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:36:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:08,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:36:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:08,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:36:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:08,605 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-28 20:36:08,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:08,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579762588] [2023-11-28 20:36:08,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579762588] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:08,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:08,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-28 20:36:08,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926134613] [2023-11-28 20:36:08,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:08,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-28 20:36:08,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:08,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-28 20:36:08,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-28 20:36:08,609 INFO L87 Difference]: Start difference. First operand 104 states and 155 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-28 20:36:09,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:09,486 INFO L93 Difference]: Finished difference Result 110 states and 161 transitions. [2023-11-28 20:36:09,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 20:36:09,487 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 86 [2023-11-28 20:36:09,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:09,489 INFO L225 Difference]: With dead ends: 110 [2023-11-28 20:36:09,490 INFO L226 Difference]: Without dead ends: 108 [2023-11-28 20:36:09,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2023-11-28 20:36:09,492 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 54 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:09,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 197 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-28 20:36:09,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-28 20:36:09,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2023-11-28 20:36:09,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 60 states have internal predecessors, (73), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-28 20:36:09,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 157 transitions. [2023-11-28 20:36:09,515 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 157 transitions. Word has length 86 [2023-11-28 20:36:09,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:09,515 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 157 transitions. [2023-11-28 20:36:09,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-28 20:36:09,516 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 157 transitions. [2023-11-28 20:36:09,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-28 20:36:09,518 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:09,518 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:36:09,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-28 20:36:09,518 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:09,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:09,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1204557765, now seen corresponding path program 1 times [2023-11-28 20:36:09,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:09,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323521208] [2023-11-28 20:36:09,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:09,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:14,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:36:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:14,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:36:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:14,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:36:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:14,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:36:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:14,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:36:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:14,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:36:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:14,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:36:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:14,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:36:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:14,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:36:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:14,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:36:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:14,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:36:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:14,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:36:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:14,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:36:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:14,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:36:14,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:14,708 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-28 20:36:14,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:14,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323521208] [2023-11-28 20:36:14,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323521208] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:14,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:14,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-28 20:36:14,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111099622] [2023-11-28 20:36:14,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:14,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 20:36:14,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:14,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 20:36:14,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:36:14,711 INFO L87 Difference]: Start difference. First operand 106 states and 157 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-28 20:36:16,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:16,350 INFO L93 Difference]: Finished difference Result 146 states and 208 transitions. [2023-11-28 20:36:16,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-28 20:36:16,351 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 86 [2023-11-28 20:36:16,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:16,353 INFO L225 Difference]: With dead ends: 146 [2023-11-28 20:36:16,353 INFO L226 Difference]: Without dead ends: 144 [2023-11-28 20:36:16,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2023-11-28 20:36:16,354 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 110 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:16,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 231 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-28 20:36:16,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-11-28 20:36:16,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 113. [2023-11-28 20:36:16,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 67 states have internal predecessors, (85), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-28 20:36:16,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 169 transitions. [2023-11-28 20:36:16,379 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 169 transitions. Word has length 86 [2023-11-28 20:36:16,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:16,380 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 169 transitions. [2023-11-28 20:36:16,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-28 20:36:16,381 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 169 transitions. [2023-11-28 20:36:16,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-28 20:36:16,382 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:16,383 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:36:16,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-28 20:36:16,383 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:16,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:16,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1206404807, now seen corresponding path program 1 times [2023-11-28 20:36:16,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:16,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916604792] [2023-11-28 20:36:16,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:16,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:16,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:36:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:16,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:36:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:16,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:36:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:16,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:36:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:16,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:36:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:16,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:36:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:16,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:36:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:16,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:36:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:16,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:36:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:16,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:36:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:16,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:36:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:16,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:36:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:16,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:36:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:16,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:36:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:16,535 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-28 20:36:16,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:16,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916604792] [2023-11-28 20:36:16,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916604792] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:16,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:16,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:36:16,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143968046] [2023-11-28 20:36:16,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:16,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:36:16,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:16,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:36:16,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:36:16,539 INFO L87 Difference]: Start difference. First operand 113 states and 169 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-28 20:36:16,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:16,675 INFO L93 Difference]: Finished difference Result 186 states and 266 transitions. [2023-11-28 20:36:16,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 20:36:16,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 86 [2023-11-28 20:36:16,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:16,678 INFO L225 Difference]: With dead ends: 186 [2023-11-28 20:36:16,678 INFO L226 Difference]: Without dead ends: 148 [2023-11-28 20:36:16,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-28 20:36:16,680 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 61 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:16,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 140 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 20:36:16,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-11-28 20:36:16,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 126. [2023-11-28 20:36:16,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 77 states have internal predecessors, (93), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-28 20:36:16,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 177 transitions. [2023-11-28 20:36:16,704 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 177 transitions. Word has length 86 [2023-11-28 20:36:16,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:16,704 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 177 transitions. [2023-11-28 20:36:16,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-28 20:36:16,705 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 177 transitions. [2023-11-28 20:36:16,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-28 20:36:16,706 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:16,706 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:36:16,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-28 20:36:16,707 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:16,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:16,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1261816067, now seen corresponding path program 1 times [2023-11-28 20:36:16,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:16,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620039961] [2023-11-28 20:36:16,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:16,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:27,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:36:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:27,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:36:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:27,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:36:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:27,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:36:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:27,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:36:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:27,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:36:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:27,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:36:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:27,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:36:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:27,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:36:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:27,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:36:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:27,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:36:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:27,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:36:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:27,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:36:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:27,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:36:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:27,429 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-28 20:36:27,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:27,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620039961] [2023-11-28 20:36:27,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620039961] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:27,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:27,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-28 20:36:27,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981519884] [2023-11-28 20:36:27,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:27,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 20:36:27,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:27,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 20:36:27,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:36:27,431 INFO L87 Difference]: Start difference. First operand 126 states and 177 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-28 20:36:28,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:28,422 INFO L93 Difference]: Finished difference Result 165 states and 221 transitions. [2023-11-28 20:36:28,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-28 20:36:28,423 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 86 [2023-11-28 20:36:28,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:28,425 INFO L225 Difference]: With dead ends: 165 [2023-11-28 20:36:28,425 INFO L226 Difference]: Without dead ends: 163 [2023-11-28 20:36:28,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2023-11-28 20:36:28,426 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 93 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:28,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 226 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-28 20:36:28,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-11-28 20:36:28,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 131. [2023-11-28 20:36:28,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 81 states have (on average 1.2098765432098766) internal successors, (98), 81 states have internal predecessors, (98), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-28 20:36:28,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 182 transitions. [2023-11-28 20:36:28,456 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 182 transitions. Word has length 86 [2023-11-28 20:36:28,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:28,457 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 182 transitions. [2023-11-28 20:36:28,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-28 20:36:28,457 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 182 transitions. [2023-11-28 20:36:28,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-28 20:36:28,458 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:28,458 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:36:28,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-28 20:36:28,459 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:28,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:28,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1263663109, now seen corresponding path program 1 times [2023-11-28 20:36:28,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:28,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663215458] [2023-11-28 20:36:28,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:28,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:30,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:36:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:30,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:36:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:30,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:36:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:30,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:36:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:30,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:36:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:30,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:36:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:30,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:36:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:30,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:36:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:30,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:36:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:30,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:36:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:30,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:36:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:30,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:36:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:30,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:36:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:30,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:36:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:30,742 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-28 20:36:30,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:30,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663215458] [2023-11-28 20:36:30,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663215458] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:30,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:30,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-28 20:36:30,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912890582] [2023-11-28 20:36:30,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:30,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-28 20:36:30,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:30,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-28 20:36:30,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-28 20:36:30,744 INFO L87 Difference]: Start difference. First operand 131 states and 182 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-28 20:36:31,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:31,602 INFO L93 Difference]: Finished difference Result 206 states and 280 transitions. [2023-11-28 20:36:31,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-28 20:36:31,603 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 86 [2023-11-28 20:36:31,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:31,604 INFO L225 Difference]: With dead ends: 206 [2023-11-28 20:36:31,604 INFO L226 Difference]: Without dead ends: 165 [2023-11-28 20:36:31,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2023-11-28 20:36:31,605 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 75 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:31,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 259 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-28 20:36:31,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-11-28 20:36:31,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 129. [2023-11-28 20:36:31,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 79 states have internal predecessors, (94), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-28 20:36:31,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 178 transitions. [2023-11-28 20:36:31,633 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 178 transitions. Word has length 86 [2023-11-28 20:36:31,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:31,634 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 178 transitions. [2023-11-28 20:36:31,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-28 20:36:31,634 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 178 transitions. [2023-11-28 20:36:31,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-28 20:36:31,635 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:31,635 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:36:31,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-28 20:36:31,636 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:31,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:31,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1313450494, now seen corresponding path program 1 times [2023-11-28 20:36:31,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:31,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867770642] [2023-11-28 20:36:31,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:31,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:34,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:36:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:34,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:36:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:34,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:36:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:34,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:36:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:34,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:36:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:34,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:36:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:34,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:36:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:34,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:36:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:34,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:36:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:34,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:36:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:34,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:36:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:34,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:36:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:34,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:36:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:34,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:36:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:34,554 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-28 20:36:34,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:34,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867770642] [2023-11-28 20:36:34,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867770642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:34,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:34,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-28 20:36:34,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670730923] [2023-11-28 20:36:34,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:34,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-28 20:36:34,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:34,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-28 20:36:34,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-28 20:36:34,557 INFO L87 Difference]: Start difference. First operand 129 states and 178 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-28 20:36:35,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:35,808 INFO L93 Difference]: Finished difference Result 154 states and 206 transitions. [2023-11-28 20:36:35,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-28 20:36:35,808 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 87 [2023-11-28 20:36:35,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:35,810 INFO L225 Difference]: With dead ends: 154 [2023-11-28 20:36:35,810 INFO L226 Difference]: Without dead ends: 152 [2023-11-28 20:36:35,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2023-11-28 20:36:35,811 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 73 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:35,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 229 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-28 20:36:35,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-11-28 20:36:35,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 131. [2023-11-28 20:36:35,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 81 states have (on average 1.1975308641975309) internal successors, (97), 81 states have internal predecessors, (97), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-28 20:36:35,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 181 transitions. [2023-11-28 20:36:35,829 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 181 transitions. Word has length 87 [2023-11-28 20:36:35,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:35,829 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 181 transitions. [2023-11-28 20:36:35,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-28 20:36:35,830 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 181 transitions. [2023-11-28 20:36:35,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-28 20:36:35,831 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:35,831 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:36:35,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-28 20:36:35,831 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:35,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:35,832 INFO L85 PathProgramCache]: Analyzing trace with hash 461556868, now seen corresponding path program 1 times [2023-11-28 20:36:35,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:35,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696217175] [2023-11-28 20:36:35,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:35,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:40,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:36:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:40,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:36:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:40,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:36:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:40,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:36:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:40,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:36:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:40,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:36:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:40,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:36:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:40,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:36:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:40,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:36:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:40,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:36:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:40,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:36:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:40,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:36:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:40,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:36:40,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:40,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:36:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:40,238 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-28 20:36:40,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:40,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696217175] [2023-11-28 20:36:40,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696217175] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:40,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:40,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-28 20:36:40,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819473422] [2023-11-28 20:36:40,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:40,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-28 20:36:40,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:40,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-28 20:36:40,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-28 20:36:40,240 INFO L87 Difference]: Start difference. First operand 131 states and 181 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-28 20:36:41,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:41,793 INFO L93 Difference]: Finished difference Result 150 states and 200 transitions. [2023-11-28 20:36:41,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-28 20:36:41,793 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 87 [2023-11-28 20:36:41,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:41,794 INFO L225 Difference]: With dead ends: 150 [2023-11-28 20:36:41,795 INFO L226 Difference]: Without dead ends: 148 [2023-11-28 20:36:41,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2023-11-28 20:36:41,795 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 77 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:41,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 228 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-28 20:36:41,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-11-28 20:36:41,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 129. [2023-11-28 20:36:41,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 79 states have internal predecessors, (94), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-28 20:36:41,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 178 transitions. [2023-11-28 20:36:41,821 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 178 transitions. Word has length 87 [2023-11-28 20:36:41,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:41,821 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 178 transitions. [2023-11-28 20:36:41,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-28 20:36:41,821 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 178 transitions. [2023-11-28 20:36:41,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-11-28 20:36:41,824 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:41,824 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:36:41,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-28 20:36:41,824 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:41,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:41,825 INFO L85 PathProgramCache]: Analyzing trace with hash 324235561, now seen corresponding path program 1 times [2023-11-28 20:36:41,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:41,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929917937] [2023-11-28 20:36:41,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:41,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:36:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:36:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:36:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:36:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:36:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:36:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:36:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:36:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:36:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:36:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:36:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:36:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:36:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:36:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-28 20:36:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-28 20:36:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-28 20:36:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-28 20:36:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-28 20:36:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-28 20:36:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-28 20:36:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-28 20:36:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-28 20:36:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-28 20:36:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-28 20:36:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-28 20:36:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-28 20:36:47,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-28 20:36:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1539 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-11-28 20:36:47,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:47,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929917937] [2023-11-28 20:36:47,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929917937] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:36:47,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158602797] [2023-11-28 20:36:47,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:47,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:36:47,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d32940e-2dd0-4363-a167-a273f3b50d8a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:36:47,331 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d32940e-2dd0-4363-a167-a273f3b50d8a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:36:47,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d32940e-2dd0-4363-a167-a273f3b50d8a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-28 20:36:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-28 20:36:47,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:47,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1539 backedges. 914 proven. 33 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2023-11-28 20:36:47,678 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:36:47,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1539 backedges. 31 proven. 75 refuted. 0 times theorem prover too weak. 1433 trivial. 0 not checked. [2023-11-28 20:36:47,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158602797] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:36:47,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:36:47,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 5] total 21 [2023-11-28 20:36:47,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345279939] [2023-11-28 20:36:47,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:36:47,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-28 20:36:47,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:36:47,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-28 20:36:47,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2023-11-28 20:36:47,938 INFO L87 Difference]: Start difference. First operand 129 states and 178 transitions. Second operand has 21 states, 21 states have (on average 3.9047619047619047) internal successors, (82), 21 states have internal predecessors, (82), 5 states have call successors, (78), 3 states have call predecessors, (78), 5 states have return successors, (80), 5 states have call predecessors, (80), 5 states have call successors, (80) [2023-11-28 20:36:54,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:54,759 INFO L93 Difference]: Finished difference Result 288 states and 378 transitions. [2023-11-28 20:36:54,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-28 20:36:54,760 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.9047619047619047) internal successors, (82), 21 states have internal predecessors, (82), 5 states have call successors, (78), 3 states have call predecessors, (78), 5 states have return successors, (80), 5 states have call predecessors, (80), 5 states have call successors, (80) Word has length 170 [2023-11-28 20:36:54,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:54,762 INFO L225 Difference]: With dead ends: 288 [2023-11-28 20:36:54,762 INFO L226 Difference]: Without dead ends: 245 [2023-11-28 20:36:54,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1611 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=825, Invalid=4577, Unknown=0, NotChecked=0, Total=5402 [2023-11-28 20:36:54,765 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 395 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:54,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 363 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-28 20:36:54,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2023-11-28 20:36:54,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 144. [2023-11-28 20:36:54,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 90 states have (on average 1.1444444444444444) internal successors, (103), 90 states have internal predecessors, (103), 42 states have call successors, (42), 11 states have call predecessors, (42), 11 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-28 20:36:54,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 187 transitions. [2023-11-28 20:36:54,791 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 187 transitions. Word has length 170 [2023-11-28 20:36:54,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:54,792 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 187 transitions. [2023-11-28 20:36:54,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.9047619047619047) internal successors, (82), 21 states have internal predecessors, (82), 5 states have call successors, (78), 3 states have call predecessors, (78), 5 states have return successors, (80), 5 states have call predecessors, (80), 5 states have call successors, (80) [2023-11-28 20:36:54,792 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 187 transitions. [2023-11-28 20:36:54,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-11-28 20:36:54,794 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:54,794 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:36:54,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d32940e-2dd0-4363-a167-a273f3b50d8a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-28 20:36:54,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d32940e-2dd0-4363-a167-a273f3b50d8a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-28 20:36:54,995 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:36:54,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:54,995 INFO L85 PathProgramCache]: Analyzing trace with hash -774169141, now seen corresponding path program 1 times [2023-11-28 20:36:54,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:36:54,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571898105] [2023-11-28 20:36:54,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:54,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:36:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:36:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:36:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:36:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:36:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:36:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:36:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:36:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:36:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:36:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:36:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:36:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:36:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:36:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:36:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-28 20:36:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-28 20:36:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-28 20:36:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-28 20:36:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-28 20:36:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-28 20:36:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-28 20:36:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-28 20:36:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-28 20:36:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-28 20:36:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-28 20:36:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-28 20:36:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-28 20:36:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-28 20:36:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-11-28 20:36:58,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:36:58,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571898105] [2023-11-28 20:36:58,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571898105] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:36:58,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557006394] [2023-11-28 20:36:58,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:58,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:36:58,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d32940e-2dd0-4363-a167-a273f3b50d8a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:36:58,152 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d32940e-2dd0-4363-a167-a273f3b50d8a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:36:58,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d32940e-2dd0-4363-a167-a273f3b50d8a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-28 20:36:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-28 20:36:58,278 INFO L285 TraceCheckSpWp]: Computing forward predicates...