./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_ae882207-235e-4cd5-a29e-83b495fa9587/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae882207-235e-4cd5-a29e-83b495fa9587/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae882207-235e-4cd5-a29e-83b495fa9587/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae882207-235e-4cd5-a29e-83b495fa9587/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae882207-235e-4cd5-a29e-83b495fa9587/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae882207-235e-4cd5-a29e-83b495fa9587/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --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 64bit --witnessprinter.graph.data.programhash d9b118296c3c6ba241fa831bfdb5289a0072e9871a56ce58ee16beb68bb5aa55 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:46:28,194 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:46:28,200 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:46:28,233 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:46:28,233 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:46:28,234 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:46:28,236 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:46:28,237 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:46:28,239 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:46:28,240 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:46:28,241 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:46:28,243 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:46:28,243 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:46:28,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:46:28,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:46:28,247 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:46:28,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:46:28,249 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:46:28,251 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:46:28,253 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:46:28,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:46:28,256 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:46:28,257 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:46:28,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:46:28,262 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:46:28,263 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:46:28,263 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:46:28,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:46:28,265 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:46:28,266 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:46:28,266 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:46:28,267 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:46:28,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:46:28,269 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:46:28,270 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:46:28,271 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:46:28,271 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:46:28,272 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:46:28,272 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:46:28,273 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:46:28,274 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:46:28,283 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae882207-235e-4cd5-a29e-83b495fa9587/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 20:46:28,323 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:46:28,324 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:46:28,325 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:46:28,325 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:46:28,327 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:46:28,327 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:46:28,328 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:46:28,328 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:46:28,328 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:46:28,328 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:46:28,330 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:46:28,330 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:46:28,330 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:46:28,330 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:46:28,330 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:46:28,331 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:46:28,331 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:46:28,331 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:46:28,331 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:46:28,332 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:46:28,332 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:46:28,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:46:28,332 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:46:28,332 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:46:28,333 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:46:28,333 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:46:28,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:46:28,333 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:46:28,333 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:46:28,334 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:46:28,334 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_ae882207-235e-4cd5-a29e-83b495fa9587/bin/uautomizer-Dbtcem3rbc/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_ae882207-235e-4cd5-a29e-83b495fa9587/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d9b118296c3c6ba241fa831bfdb5289a0072e9871a56ce58ee16beb68bb5aa55 [2022-11-02 20:46:28,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:46:28,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:46:28,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:46:28,749 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:46:28,750 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:46:28,752 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae882207-235e-4cd5-a29e-83b495fa9587/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2022-11-02 20:46:28,830 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae882207-235e-4cd5-a29e-83b495fa9587/bin/uautomizer-Dbtcem3rbc/data/d29f3bf0e/506d0d77839a4bb78948510660cc2351/FLAG145d8fc2e [2022-11-02 20:46:29,704 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:46:29,706 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae882207-235e-4cd5-a29e-83b495fa9587/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2022-11-02 20:46:29,752 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae882207-235e-4cd5-a29e-83b495fa9587/bin/uautomizer-Dbtcem3rbc/data/d29f3bf0e/506d0d77839a4bb78948510660cc2351/FLAG145d8fc2e [2022-11-02 20:46:29,787 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae882207-235e-4cd5-a29e-83b495fa9587/bin/uautomizer-Dbtcem3rbc/data/d29f3bf0e/506d0d77839a4bb78948510660cc2351 [2022-11-02 20:46:29,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:46:29,793 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:46:29,798 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:46:29,798 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:46:29,802 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:46:29,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:46:29" (1/1) ... [2022-11-02 20:46:29,805 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@772665bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:29, skipping insertion in model container [2022-11-02 20:46:29,805 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:46:29" (1/1) ... [2022-11-02 20:46:29,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:46:29,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:46:30,872 WARN L230 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_ae882207-235e-4cd5-a29e-83b495fa9587/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i[146121,146134] [2022-11-02 20:46:30,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:46:30,955 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:46:31,202 WARN L230 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_ae882207-235e-4cd5-a29e-83b495fa9587/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i[146121,146134] [2022-11-02 20:46:31,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:46:31,296 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:46:31,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:31 WrapperNode [2022-11-02 20:46:31,298 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:46:31,300 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:46:31,300 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:46:31,301 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:46:31,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:31" (1/1) ... [2022-11-02 20:46:31,358 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:31" (1/1) ... [2022-11-02 20:46:31,475 INFO L138 Inliner]: procedures = 81, calls = 494, calls flagged for inlining = 37, calls inlined = 37, statements flattened = 1672 [2022-11-02 20:46:31,478 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:46:31,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:46:31,480 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:46:31,480 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:46:31,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:31" (1/1) ... [2022-11-02 20:46:31,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:31" (1/1) ... [2022-11-02 20:46:31,502 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:31" (1/1) ... [2022-11-02 20:46:31,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:31" (1/1) ... [2022-11-02 20:46:31,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:31" (1/1) ... [2022-11-02 20:46:31,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:31" (1/1) ... [2022-11-02 20:46:31,558 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:31" (1/1) ... [2022-11-02 20:46:31,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:31" (1/1) ... [2022-11-02 20:46:31,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:46:31,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:46:31,573 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:46:31,574 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:46:31,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:31" (1/1) ... [2022-11-02 20:46:31,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:46:31,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae882207-235e-4cd5-a29e-83b495fa9587/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:46:31,605 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae882207-235e-4cd5-a29e-83b495fa9587/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:46:31,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae882207-235e-4cd5-a29e-83b495fa9587/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:46:31,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:46:31,667 INFO L130 BoogieDeclarations]: Found specification of procedure ir_init [2022-11-02 20:46:31,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_init [2022-11-02 20:46:31,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:46:31,668 INFO L130 BoogieDeclarations]: Found specification of procedure ir_exit [2022-11-02 20:46:31,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_exit [2022-11-02 20:46:31,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:46:31,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:46:31,669 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-11-02 20:46:31,669 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-11-02 20:46:31,669 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-11-02 20:46:31,669 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-11-02 20:46:31,669 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-02 20:46:31,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-02 20:46:31,670 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-11-02 20:46:31,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-11-02 20:46:31,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:46:31,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:46:31,670 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-02 20:46:31,670 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-02 20:46:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:46:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure usb_serial_deregister [2022-11-02 20:46:31,671 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_serial_deregister [2022-11-02 20:46:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-11-02 20:46:31,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-11-02 20:46:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-11-02 20:46:31,672 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-11-02 20:46:31,672 INFO L130 BoogieDeclarations]: Found specification of procedure ir_xbof_change [2022-11-02 20:46:31,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_xbof_change [2022-11-02 20:46:31,672 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-11-02 20:46:31,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-11-02 20:46:31,672 INFO L130 BoogieDeclarations]: Found specification of procedure __kfifo_uint_must_check_helper [2022-11-02 20:46:31,673 INFO L138 BoogieDeclarations]: Found implementation of procedure __kfifo_uint_must_check_helper [2022-11-02 20:46:31,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:46:31,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:46:31,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:46:31,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:46:32,015 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:46:32,017 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:46:32,025 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:46:32,098 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2022-11-02 20:46:32,098 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2022-11-02 20:46:32,224 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-11-02 20:46:32,242 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:46:32,248 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:46:32,266 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:46:33,619 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##74: assume !false; [2022-11-02 20:46:33,620 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##73: assume false; [2022-11-02 20:46:33,620 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##258: assume false; [2022-11-02 20:46:33,620 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##259: assume !false; [2022-11-02 20:46:33,620 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2022-11-02 20:46:33,620 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2022-11-02 20:46:33,630 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:46:33,650 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:46:33,650 INFO L300 CfgBuilder]: Removed 23 assume(true) statements. [2022-11-02 20:46:33,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:46:33 BoogieIcfgContainer [2022-11-02 20:46:33,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:46:33,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:46:33,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:46:33,662 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:46:33,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:46:29" (1/3) ... [2022-11-02 20:46:33,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88f9cb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:46:33, skipping insertion in model container [2022-11-02 20:46:33,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:46:31" (2/3) ... [2022-11-02 20:46:33,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88f9cb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:46:33, skipping insertion in model container [2022-11-02 20:46:33,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:46:33" (3/3) ... [2022-11-02 20:46:33,667 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2022-11-02 20:46:33,689 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:46:33,689 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:46:33,806 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:46:33,816 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=LoopsAndPotentialCycles, 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;@3c521648, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:46:33,817 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:46:33,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 301 states, 262 states have (on average 1.5076335877862594) internal successors, (395), 272 states have internal predecessors, (395), 25 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-11-02 20:46:33,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:46:33,835 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:33,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:33,836 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:46:33,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:33,845 INFO L85 PathProgramCache]: Analyzing trace with hash -248243768, now seen corresponding path program 1 times [2022-11-02 20:46:33,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:33,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111833608] [2022-11-02 20:46:33,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:33,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:35,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:35,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:46:35,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:35,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111833608] [2022-11-02 20:46:35,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111833608] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:35,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:35,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:46:35,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263666920] [2022-11-02 20:46:35,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:35,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:46:35,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:35,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:46:35,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:46:35,281 INFO L87 Difference]: Start difference. First operand has 301 states, 262 states have (on average 1.5076335877862594) internal successors, (395), 272 states have internal predecessors, (395), 25 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:46:36,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:36,846 INFO L93 Difference]: Finished difference Result 845 states and 1261 transitions. [2022-11-02 20:46:36,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:46:36,849 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-11-02 20:46:36,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:36,875 INFO L225 Difference]: With dead ends: 845 [2022-11-02 20:46:36,877 INFO L226 Difference]: Without dead ends: 538 [2022-11-02 20:46:36,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:46:36,891 INFO L413 NwaCegarLoop]: 340 mSDtfsCounter, 460 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:36,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 1269 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-02 20:46:36,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-11-02 20:46:37,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 528. [2022-11-02 20:46:37,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 469 states have (on average 1.3411513859275053) internal successors, (629), 478 states have internal predecessors, (629), 38 states have call successors, (38), 21 states have call predecessors, (38), 20 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-02 20:46:37,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 702 transitions. [2022-11-02 20:46:37,034 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 702 transitions. Word has length 18 [2022-11-02 20:46:37,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:37,036 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 702 transitions. [2022-11-02 20:46:37,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:46:37,036 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 702 transitions. [2022-11-02 20:46:37,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:46:37,040 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:37,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:37,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:46:37,045 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:46:37,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:37,045 INFO L85 PathProgramCache]: Analyzing trace with hash -835049782, now seen corresponding path program 1 times [2022-11-02 20:46:37,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:37,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092123012] [2022-11-02 20:46:37,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:37,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:37,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:37,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:46:37,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:37,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092123012] [2022-11-02 20:46:37,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092123012] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:37,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:37,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:46:37,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796707748] [2022-11-02 20:46:37,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:37,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:46:37,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:37,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:46:37,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:46:37,389 INFO L87 Difference]: Start difference. First operand 528 states and 702 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:46:38,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:38,202 INFO L93 Difference]: Finished difference Result 1543 states and 2060 transitions. [2022-11-02 20:46:38,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:46:38,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-11-02 20:46:38,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:38,209 INFO L225 Difference]: With dead ends: 1543 [2022-11-02 20:46:38,209 INFO L226 Difference]: Without dead ends: 1033 [2022-11-02 20:46:38,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:46:38,213 INFO L413 NwaCegarLoop]: 411 mSDtfsCounter, 470 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:38,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 906 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:46:38,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2022-11-02 20:46:38,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1020. [2022-11-02 20:46:38,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 913 states have (on average 1.343921139101862) internal successors, (1227), 926 states have internal predecessors, (1227), 69 states have call successors, (69), 38 states have call predecessors, (69), 37 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2022-11-02 20:46:38,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1362 transitions. [2022-11-02 20:46:38,272 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1362 transitions. Word has length 18 [2022-11-02 20:46:38,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:38,273 INFO L495 AbstractCegarLoop]: Abstraction has 1020 states and 1362 transitions. [2022-11-02 20:46:38,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:46:38,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1362 transitions. [2022-11-02 20:46:38,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:46:38,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:38,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:38,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:46:38,274 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:46:38,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:38,275 INFO L85 PathProgramCache]: Analyzing trace with hash -116851219, now seen corresponding path program 1 times [2022-11-02 20:46:38,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:38,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350754407] [2022-11-02 20:46:38,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:38,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:46:38,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:38,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350754407] [2022-11-02 20:46:38,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350754407] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:38,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:38,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:46:38,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077579128] [2022-11-02 20:46:38,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:38,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:46:38,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:38,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:46:38,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:46:38,514 INFO L87 Difference]: Start difference. First operand 1020 states and 1362 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:46:38,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:38,960 INFO L93 Difference]: Finished difference Result 1022 states and 1363 transitions. [2022-11-02 20:46:38,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:46:38,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-11-02 20:46:38,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:38,968 INFO L225 Difference]: With dead ends: 1022 [2022-11-02 20:46:38,968 INFO L226 Difference]: Without dead ends: 1001 [2022-11-02 20:46:38,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:46:38,970 INFO L413 NwaCegarLoop]: 376 mSDtfsCounter, 421 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:38,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 593 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:46:38,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2022-11-02 20:46:39,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 1001. [2022-11-02 20:46:39,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 902 states have (on average 1.3414634146341464) internal successors, (1210), 912 states have internal predecessors, (1210), 64 states have call successors, (64), 35 states have call predecessors, (64), 34 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2022-11-02 20:46:39,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1336 transitions. [2022-11-02 20:46:39,070 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1336 transitions. Word has length 19 [2022-11-02 20:46:39,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:39,071 INFO L495 AbstractCegarLoop]: Abstraction has 1001 states and 1336 transitions. [2022-11-02 20:46:39,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:46:39,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1336 transitions. [2022-11-02 20:46:39,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-02 20:46:39,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:39,087 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:39,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:46:39,088 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:46:39,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:39,088 INFO L85 PathProgramCache]: Analyzing trace with hash -470649452, now seen corresponding path program 1 times [2022-11-02 20:46:39,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:39,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934742654] [2022-11-02 20:46:39,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:39,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:39,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:39,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:46:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:39,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:46:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:39,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:46:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:39,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 20:46:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:39,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:39,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:46:39,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:39,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934742654] [2022-11-02 20:46:39,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934742654] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:39,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:39,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:46:39,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138437334] [2022-11-02 20:46:39,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:39,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:46:39,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:39,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:46:39,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:46:39,744 INFO L87 Difference]: Start difference. First operand 1001 states and 1336 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:46:40,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:40,982 INFO L93 Difference]: Finished difference Result 2037 states and 2716 transitions. [2022-11-02 20:46:40,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:46:40,983 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 76 [2022-11-02 20:46:40,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:41,008 INFO L225 Difference]: With dead ends: 2037 [2022-11-02 20:46:41,008 INFO L226 Difference]: Without dead ends: 1057 [2022-11-02 20:46:41,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:46:41,011 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 704 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:41,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 1226 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:46:41,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2022-11-02 20:46:41,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 1001. [2022-11-02 20:46:41,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 902 states have (on average 1.3392461197339247) internal successors, (1208), 912 states have internal predecessors, (1208), 64 states have call successors, (64), 35 states have call predecessors, (64), 34 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2022-11-02 20:46:41,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1334 transitions. [2022-11-02 20:46:41,127 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1334 transitions. Word has length 76 [2022-11-02 20:46:41,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:41,127 INFO L495 AbstractCegarLoop]: Abstraction has 1001 states and 1334 transitions. [2022-11-02 20:46:41,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:46:41,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1334 transitions. [2022-11-02 20:46:41,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-02 20:46:41,132 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:41,133 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:41,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:46:41,133 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:46:41,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:41,134 INFO L85 PathProgramCache]: Analyzing trace with hash -26748778, now seen corresponding path program 1 times [2022-11-02 20:46:41,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:41,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935693920] [2022-11-02 20:46:41,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:41,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:41,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:41,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:46:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:41,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:46:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:41,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:46:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:41,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 20:46:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:41,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:41,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:46:41,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:41,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935693920] [2022-11-02 20:46:41,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935693920] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:41,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:41,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:46:41,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113979924] [2022-11-02 20:46:41,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:41,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:46:41,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:41,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:46:41,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:46:41,679 INFO L87 Difference]: Start difference. First operand 1001 states and 1334 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 20:46:42,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:42,760 INFO L93 Difference]: Finished difference Result 3001 states and 4072 transitions. [2022-11-02 20:46:42,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:46:42,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 76 [2022-11-02 20:46:42,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:42,773 INFO L225 Difference]: With dead ends: 3001 [2022-11-02 20:46:42,773 INFO L226 Difference]: Without dead ends: 2021 [2022-11-02 20:46:42,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:46:42,778 INFO L413 NwaCegarLoop]: 782 mSDtfsCounter, 654 mSDsluCounter, 1974 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 2756 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:42,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 2756 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:46:42,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2021 states. [2022-11-02 20:46:42,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2021 to 977. [2022-11-02 20:46:42,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 887 states have (on average 1.3370913190529876) internal successors, (1186), 893 states have internal predecessors, (1186), 57 states have call successors, (57), 33 states have call predecessors, (57), 32 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2022-11-02 20:46:42,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1298 transitions. [2022-11-02 20:46:42,884 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1298 transitions. Word has length 76 [2022-11-02 20:46:42,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:42,885 INFO L495 AbstractCegarLoop]: Abstraction has 977 states and 1298 transitions. [2022-11-02 20:46:42,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 20:46:42,885 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1298 transitions. [2022-11-02 20:46:42,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-02 20:46:42,888 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:42,888 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:42,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:46:42,888 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:46:42,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:42,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1980008620, now seen corresponding path program 1 times [2022-11-02 20:46:42,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:42,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333935288] [2022-11-02 20:46:42,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:42,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:43,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:43,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:46:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:43,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:46:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:43,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:46:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:43,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:46:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:43,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:46:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:43,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:46:43,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:43,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333935288] [2022-11-02 20:46:43,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333935288] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:43,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:43,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:46:43,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345206463] [2022-11-02 20:46:43,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:43,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:46:43,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:43,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:46:43,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:46:43,791 INFO L87 Difference]: Start difference. First operand 977 states and 1298 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 20:46:45,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:45,167 INFO L93 Difference]: Finished difference Result 2238 states and 3026 transitions. [2022-11-02 20:46:45,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:46:45,168 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 73 [2022-11-02 20:46:45,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:45,177 INFO L225 Difference]: With dead ends: 2238 [2022-11-02 20:46:45,177 INFO L226 Difference]: Without dead ends: 1735 [2022-11-02 20:46:45,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:46:45,181 INFO L413 NwaCegarLoop]: 634 mSDtfsCounter, 389 mSDsluCounter, 3338 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 3972 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:45,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 3972 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:46:45,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-11-02 20:46:45,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1005. [2022-11-02 20:46:45,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 907 states have (on average 1.3296582138919515) internal successors, (1206), 913 states have internal predecessors, (1206), 57 states have call successors, (57), 33 states have call predecessors, (57), 40 states have return successors, (71), 62 states have call predecessors, (71), 55 states have call successors, (71) [2022-11-02 20:46:45,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1334 transitions. [2022-11-02 20:46:45,317 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1334 transitions. Word has length 73 [2022-11-02 20:46:45,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:45,318 INFO L495 AbstractCegarLoop]: Abstraction has 1005 states and 1334 transitions. [2022-11-02 20:46:45,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 20:46:45,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1334 transitions. [2022-11-02 20:46:45,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-02 20:46:45,321 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:45,322 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:45,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:46:45,322 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:46:45,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:45,323 INFO L85 PathProgramCache]: Analyzing trace with hash 2060222131, now seen corresponding path program 1 times [2022-11-02 20:46:45,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:45,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237200660] [2022-11-02 20:46:45,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:45,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:45,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:45,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:46:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:45,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:46:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:46,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:46:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:46,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:46:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:46,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:46:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:46,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:46:46,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:46,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237200660] [2022-11-02 20:46:46,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237200660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:46,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:46,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:46:46,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711063331] [2022-11-02 20:46:46,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:46,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:46:46,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:46,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:46:46,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:46:46,066 INFO L87 Difference]: Start difference. First operand 1005 states and 1334 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 7 states have internal predecessors, (60), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 20:46:47,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:47,874 INFO L93 Difference]: Finished difference Result 2252 states and 3040 transitions. [2022-11-02 20:46:47,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:46:47,875 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 7 states have internal predecessors, (60), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 73 [2022-11-02 20:46:47,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:47,886 INFO L225 Difference]: With dead ends: 2252 [2022-11-02 20:46:47,887 INFO L226 Difference]: Without dead ends: 1735 [2022-11-02 20:46:47,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:46:47,894 INFO L413 NwaCegarLoop]: 737 mSDtfsCounter, 1004 mSDsluCounter, 4941 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 5678 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:47,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 5678 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-02 20:46:47,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-11-02 20:46:48,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1005. [2022-11-02 20:46:48,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 907 states have (on average 1.3274531422271223) internal successors, (1204), 913 states have internal predecessors, (1204), 57 states have call successors, (57), 33 states have call predecessors, (57), 40 states have return successors, (71), 62 states have call predecessors, (71), 55 states have call successors, (71) [2022-11-02 20:46:48,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1332 transitions. [2022-11-02 20:46:48,013 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1332 transitions. Word has length 73 [2022-11-02 20:46:48,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:48,014 INFO L495 AbstractCegarLoop]: Abstraction has 1005 states and 1332 transitions. [2022-11-02 20:46:48,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 7 states have internal predecessors, (60), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 20:46:48,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1332 transitions. [2022-11-02 20:46:48,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-02 20:46:48,016 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:48,017 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:48,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:46:48,017 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:46:48,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:48,018 INFO L85 PathProgramCache]: Analyzing trace with hash 190037653, now seen corresponding path program 1 times [2022-11-02 20:46:48,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:48,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221733464] [2022-11-02 20:46:48,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:48,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:48,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:48,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:46:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:48,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:46:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:48,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:46:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:48,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 20:46:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:48,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:48,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:46:48,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:48,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221733464] [2022-11-02 20:46:48,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221733464] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:48,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:48,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:46:48,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254692782] [2022-11-02 20:46:48,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:48,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:46:48,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:48,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:46:48,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:46:48,592 INFO L87 Difference]: Start difference. First operand 1005 states and 1332 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 5 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:46:49,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:49,828 INFO L93 Difference]: Finished difference Result 1546 states and 2049 transitions. [2022-11-02 20:46:49,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:46:49,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 5 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 76 [2022-11-02 20:46:49,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:49,836 INFO L225 Difference]: With dead ends: 1546 [2022-11-02 20:46:49,836 INFO L226 Difference]: Without dead ends: 1543 [2022-11-02 20:46:49,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:46:49,838 INFO L413 NwaCegarLoop]: 695 mSDtfsCounter, 980 mSDsluCounter, 1575 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 2270 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:49,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 2270 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:46:49,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2022-11-02 20:46:49,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1505. [2022-11-02 20:46:49,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1359 states have (on average 1.329654157468727) internal successors, (1807), 1369 states have internal predecessors, (1807), 86 states have call successors, (86), 48 states have call predecessors, (86), 59 states have return successors, (111), 94 states have call predecessors, (111), 84 states have call successors, (111) [2022-11-02 20:46:49,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2004 transitions. [2022-11-02 20:46:49,990 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2004 transitions. Word has length 76 [2022-11-02 20:46:49,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:49,991 INFO L495 AbstractCegarLoop]: Abstraction has 1505 states and 2004 transitions. [2022-11-02 20:46:49,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 5 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:46:49,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2004 transitions. [2022-11-02 20:46:49,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-02 20:46:49,994 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:49,994 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:49,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:46:49,995 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:46:49,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:49,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1115203550, now seen corresponding path program 1 times [2022-11-02 20:46:49,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:49,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952075858] [2022-11-02 20:46:49,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:49,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:50,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:50,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:46:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:50,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:46:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:50,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:46:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:50,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 20:46:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:50,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:50,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 20:46:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:50,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:46:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:50,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:46:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:50,901 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:46:50,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:50,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952075858] [2022-11-02 20:46:50,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952075858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:50,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:50,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:46:50,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527682553] [2022-11-02 20:46:50,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:50,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:46:50,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:50,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:46:50,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:46:50,904 INFO L87 Difference]: Start difference. First operand 1505 states and 2004 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-02 20:46:52,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:52,379 INFO L93 Difference]: Finished difference Result 3032 states and 4029 transitions. [2022-11-02 20:46:52,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:46:52,380 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 93 [2022-11-02 20:46:52,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:52,387 INFO L225 Difference]: With dead ends: 3032 [2022-11-02 20:46:52,387 INFO L226 Difference]: Without dead ends: 1548 [2022-11-02 20:46:52,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:46:52,391 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 831 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:52,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 1442 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:46:52,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2022-11-02 20:46:52,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1503. [2022-11-02 20:46:52,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1358 states have (on average 1.3276877761413843) internal successors, (1803), 1370 states have internal predecessors, (1803), 83 states have call successors, (83), 48 states have call predecessors, (83), 61 states have return successors, (111), 91 states have call predecessors, (111), 81 states have call successors, (111) [2022-11-02 20:46:52,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1997 transitions. [2022-11-02 20:46:52,576 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1997 transitions. Word has length 93 [2022-11-02 20:46:52,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:52,576 INFO L495 AbstractCegarLoop]: Abstraction has 1503 states and 1997 transitions. [2022-11-02 20:46:52,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-02 20:46:52,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1997 transitions. [2022-11-02 20:46:52,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-02 20:46:52,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:52,580 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:52,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:46:52,580 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:46:52,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:52,581 INFO L85 PathProgramCache]: Analyzing trace with hash 299119202, now seen corresponding path program 1 times [2022-11-02 20:46:52,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:52,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075250054] [2022-11-02 20:46:52,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:52,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:46:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:46:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:46:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 20:46:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 20:46:53,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:46:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:46:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:46:53,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:53,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075250054] [2022-11-02 20:46:53,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075250054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:53,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:53,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:46:53,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973472711] [2022-11-02 20:46:53,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:53,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:46:53,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:53,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:46:53,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:46:53,160 INFO L87 Difference]: Start difference. First operand 1503 states and 1997 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-02 20:46:54,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:54,676 INFO L93 Difference]: Finished difference Result 4551 states and 6043 transitions. [2022-11-02 20:46:54,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:46:54,708 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 93 [2022-11-02 20:46:54,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:54,721 INFO L225 Difference]: With dead ends: 4551 [2022-11-02 20:46:54,721 INFO L226 Difference]: Without dead ends: 3057 [2022-11-02 20:46:54,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:46:54,726 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 805 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:54,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 1940 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:46:54,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3057 states. [2022-11-02 20:46:55,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3057 to 2928. [2022-11-02 20:46:55,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2928 states, 2646 states have (on average 1.3344671201814058) internal successors, (3531), 2671 states have internal predecessors, (3531), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2022-11-02 20:46:55,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 3912 transitions. [2022-11-02 20:46:55,063 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 3912 transitions. Word has length 93 [2022-11-02 20:46:55,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:55,063 INFO L495 AbstractCegarLoop]: Abstraction has 2928 states and 3912 transitions. [2022-11-02 20:46:55,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-02 20:46:55,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 3912 transitions. [2022-11-02 20:46:55,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-02 20:46:55,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:55,067 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:55,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:46:55,068 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:46:55,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:55,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1102442664, now seen corresponding path program 1 times [2022-11-02 20:46:55,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:55,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849781468] [2022-11-02 20:46:55,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:55,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:55,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:55,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:46:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:55,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-02 20:46:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:55,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:46:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:55,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 20:46:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:55,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:55,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:46:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:55,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-02 20:46:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:55,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:46:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:55,692 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:46:55,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:55,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849781468] [2022-11-02 20:46:55,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849781468] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:55,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:55,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:46:55,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135548187] [2022-11-02 20:46:55,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:55,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:46:55,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:55,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:46:55,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:46:55,697 INFO L87 Difference]: Start difference. First operand 2928 states and 3912 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-02 20:46:57,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:57,273 INFO L93 Difference]: Finished difference Result 5994 states and 7973 transitions. [2022-11-02 20:46:57,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:46:57,274 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 94 [2022-11-02 20:46:57,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:57,288 INFO L225 Difference]: With dead ends: 5994 [2022-11-02 20:46:57,289 INFO L226 Difference]: Without dead ends: 3075 [2022-11-02 20:46:57,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:46:57,295 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 804 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:57,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1940 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:46:57,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3075 states. [2022-11-02 20:46:57,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3075 to 2931. [2022-11-02 20:46:57,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2931 states, 2649 states have (on average 1.332955832389581) internal successors, (3531), 2674 states have internal predecessors, (3531), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2022-11-02 20:46:57,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2931 states to 2931 states and 3912 transitions. [2022-11-02 20:46:57,637 INFO L78 Accepts]: Start accepts. Automaton has 2931 states and 3912 transitions. Word has length 94 [2022-11-02 20:46:57,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:57,638 INFO L495 AbstractCegarLoop]: Abstraction has 2931 states and 3912 transitions. [2022-11-02 20:46:57,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-02 20:46:57,639 INFO L276 IsEmpty]: Start isEmpty. Operand 2931 states and 3912 transitions. [2022-11-02 20:46:57,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-02 20:46:57,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:57,642 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:57,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:46:57,643 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:46:57,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:57,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1030544549, now seen corresponding path program 1 times [2022-11-02 20:46:57,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:57,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123532254] [2022-11-02 20:46:57,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:57,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:58,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:58,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:46:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:58,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:46:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:58,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:46:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:58,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:46:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:58,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:58,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:46:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:58,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 20:46:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:58,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:46:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:58,177 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:46:58,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:58,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123532254] [2022-11-02 20:46:58,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123532254] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:58,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:58,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:46:58,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550831231] [2022-11-02 20:46:58,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:58,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:46:58,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:58,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:46:58,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:46:58,180 INFO L87 Difference]: Start difference. First operand 2931 states and 3912 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-02 20:46:59,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:59,713 INFO L93 Difference]: Finished difference Result 5994 states and 7967 transitions. [2022-11-02 20:46:59,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:46:59,714 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 95 [2022-11-02 20:46:59,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:59,726 INFO L225 Difference]: With dead ends: 5994 [2022-11-02 20:46:59,727 INFO L226 Difference]: Without dead ends: 3072 [2022-11-02 20:46:59,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:46:59,733 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 798 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:59,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1940 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:46:59,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2022-11-02 20:47:00,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2925. [2022-11-02 20:47:00,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2925 states, 2643 states have (on average 1.3325766174801361) internal successors, (3522), 2668 states have internal predecessors, (3522), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2022-11-02 20:47:00,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2925 states to 2925 states and 3903 transitions. [2022-11-02 20:47:00,063 INFO L78 Accepts]: Start accepts. Automaton has 2925 states and 3903 transitions. Word has length 95 [2022-11-02 20:47:00,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:00,063 INFO L495 AbstractCegarLoop]: Abstraction has 2925 states and 3903 transitions. [2022-11-02 20:47:00,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-02 20:47:00,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2925 states and 3903 transitions. [2022-11-02 20:47:00,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-02 20:47:00,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:00,071 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:00,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:47:00,071 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:00,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:00,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1961803849, now seen corresponding path program 1 times [2022-11-02 20:47:00,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:00,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294729699] [2022-11-02 20:47:00,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:00,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:00,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:47:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:00,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:47:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:00,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:47:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:00,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:47:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:00,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:47:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:00,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:47:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:00,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:47:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:00,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-02 20:47:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:00,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:47:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:00,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:47:00,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:00,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294729699] [2022-11-02 20:47:00,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294729699] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:00,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:00,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:47:00,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258194045] [2022-11-02 20:47:00,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:00,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:47:00,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:00,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:47:00,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:47:00,682 INFO L87 Difference]: Start difference. First operand 2925 states and 3903 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-02 20:47:02,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:02,190 INFO L93 Difference]: Finished difference Result 5988 states and 7955 transitions. [2022-11-02 20:47:02,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:47:02,191 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 96 [2022-11-02 20:47:02,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:02,205 INFO L225 Difference]: With dead ends: 5988 [2022-11-02 20:47:02,206 INFO L226 Difference]: Without dead ends: 3072 [2022-11-02 20:47:02,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:47:02,212 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 800 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:02,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 1940 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:47:02,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2022-11-02 20:47:02,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2928. [2022-11-02 20:47:02,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2928 states, 2646 states have (on average 1.3310657596371882) internal successors, (3522), 2671 states have internal predecessors, (3522), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2022-11-02 20:47:02,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 3903 transitions. [2022-11-02 20:47:02,577 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 3903 transitions. Word has length 96 [2022-11-02 20:47:02,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:02,578 INFO L495 AbstractCegarLoop]: Abstraction has 2928 states and 3903 transitions. [2022-11-02 20:47:02,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-02 20:47:02,578 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 3903 transitions. [2022-11-02 20:47:02,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-02 20:47:02,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:02,582 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:02,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:47:02,583 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:02,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:02,583 INFO L85 PathProgramCache]: Analyzing trace with hash -400625242, now seen corresponding path program 1 times [2022-11-02 20:47:02,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:02,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684429861] [2022-11-02 20:47:02,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:02,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:02,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:47:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:02,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:47:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:03,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 20:47:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:03,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:47:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:03,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:47:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:03,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:47:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:03,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-02 20:47:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:03,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-02 20:47:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:03,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:47:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:03,063 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:47:03,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:03,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684429861] [2022-11-02 20:47:03,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684429861] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:03,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:03,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:47:03,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796765503] [2022-11-02 20:47:03,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:03,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:47:03,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:03,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:47:03,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:47:03,067 INFO L87 Difference]: Start difference. First operand 2928 states and 3903 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-02 20:47:04,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:04,587 INFO L93 Difference]: Finished difference Result 5988 states and 7949 transitions. [2022-11-02 20:47:04,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:47:04,588 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 97 [2022-11-02 20:47:04,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:04,613 INFO L225 Difference]: With dead ends: 5988 [2022-11-02 20:47:04,618 INFO L226 Difference]: Without dead ends: 3069 [2022-11-02 20:47:04,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:47:04,625 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 794 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:04,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 1940 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:47:04,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2022-11-02 20:47:04,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2922. [2022-11-02 20:47:04,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2922 states, 2640 states have (on average 1.330681818181818) internal successors, (3513), 2665 states have internal predecessors, (3513), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2022-11-02 20:47:05,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 3894 transitions. [2022-11-02 20:47:05,002 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 3894 transitions. Word has length 97 [2022-11-02 20:47:05,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:05,003 INFO L495 AbstractCegarLoop]: Abstraction has 2922 states and 3894 transitions. [2022-11-02 20:47:05,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-02 20:47:05,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 3894 transitions. [2022-11-02 20:47:05,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-02 20:47:05,007 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:05,007 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:05,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:47:05,007 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:05,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:05,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1958173396, now seen corresponding path program 1 times [2022-11-02 20:47:05,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:05,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755316507] [2022-11-02 20:47:05,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:05,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:05,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:47:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:05,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:47:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:05,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:47:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:05,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:47:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:05,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:47:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:05,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:47:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:05,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:47:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:05,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 20:47:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:05,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:47:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:05,650 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:47:05,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:05,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755316507] [2022-11-02 20:47:05,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755316507] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:05,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:05,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:47:05,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176598646] [2022-11-02 20:47:05,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:05,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:47:05,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:05,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:47:05,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:47:05,654 INFO L87 Difference]: Start difference. First operand 2922 states and 3894 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 5 states have internal predecessors, (77), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-02 20:47:07,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:07,140 INFO L93 Difference]: Finished difference Result 5970 states and 7925 transitions. [2022-11-02 20:47:07,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:47:07,141 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 5 states have internal predecessors, (77), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 98 [2022-11-02 20:47:07,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:07,159 INFO L225 Difference]: With dead ends: 5970 [2022-11-02 20:47:07,159 INFO L226 Difference]: Without dead ends: 3057 [2022-11-02 20:47:07,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:47:07,166 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 787 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:07,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 1940 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:47:07,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3057 states. [2022-11-02 20:47:07,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3057 to 2919. [2022-11-02 20:47:07,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2919 states, 2637 states have (on average 1.329920364050057) internal successors, (3507), 2662 states have internal predecessors, (3507), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2022-11-02 20:47:07,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 3888 transitions. [2022-11-02 20:47:07,584 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 3888 transitions. Word has length 98 [2022-11-02 20:47:07,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:07,584 INFO L495 AbstractCegarLoop]: Abstraction has 2919 states and 3888 transitions. [2022-11-02 20:47:07,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 5 states have internal predecessors, (77), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-02 20:47:07,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 3888 transitions. [2022-11-02 20:47:07,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-02 20:47:07,588 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:07,589 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:07,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:47:07,589 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:07,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:07,590 INFO L85 PathProgramCache]: Analyzing trace with hash -2000823641, now seen corresponding path program 1 times [2022-11-02 20:47:07,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:07,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136920630] [2022-11-02 20:47:07,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:07,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:08,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:47:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:08,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:47:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:08,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-02 20:47:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:08,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:47:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:08,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 20:47:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:08,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:47:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:08,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 20:47:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:08,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-02 20:47:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:08,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:47:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:08,152 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:47:08,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:08,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136920630] [2022-11-02 20:47:08,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136920630] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:08,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:08,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:47:08,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884193269] [2022-11-02 20:47:08,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:08,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:47:08,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:08,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:47:08,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:47:08,156 INFO L87 Difference]: Start difference. First operand 2919 states and 3888 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 5 states have internal predecessors, (78), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-02 20:47:09,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:09,664 INFO L93 Difference]: Finished difference Result 5964 states and 7913 transitions. [2022-11-02 20:47:09,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:47:09,665 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 5 states have internal predecessors, (78), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 99 [2022-11-02 20:47:09,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:09,680 INFO L225 Difference]: With dead ends: 5964 [2022-11-02 20:47:09,681 INFO L226 Difference]: Without dead ends: 3054 [2022-11-02 20:47:09,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:47:09,689 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 785 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:09,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 1940 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:47:09,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3054 states. [2022-11-02 20:47:09,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3054 to 2916. [2022-11-02 20:47:10,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2916 states, 2634 states have (on average 1.3291571753986333) internal successors, (3501), 2659 states have internal predecessors, (3501), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2022-11-02 20:47:10,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 3882 transitions. [2022-11-02 20:47:10,009 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 3882 transitions. Word has length 99 [2022-11-02 20:47:10,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:10,010 INFO L495 AbstractCegarLoop]: Abstraction has 2916 states and 3882 transitions. [2022-11-02 20:47:10,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 5 states have internal predecessors, (78), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-02 20:47:10,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 3882 transitions. [2022-11-02 20:47:10,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-02 20:47:10,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:10,014 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:10,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:47:10,014 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:10,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:10,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1968688333, now seen corresponding path program 1 times [2022-11-02 20:47:10,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:10,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893212876] [2022-11-02 20:47:10,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:10,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:10,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:47:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:10,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:47:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:10,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:47:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:10,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:47:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:10,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:47:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:10,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:47:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:10,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-02 20:47:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:10,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:47:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:10,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:47:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:10,588 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:47:10,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:10,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893212876] [2022-11-02 20:47:10,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893212876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:10,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:10,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:47:10,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37489438] [2022-11-02 20:47:10,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:10,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:47:10,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:10,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:47:10,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:47:10,591 INFO L87 Difference]: Start difference. First operand 2916 states and 3882 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 5 states have internal predecessors, (79), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-02 20:47:11,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:11,996 INFO L93 Difference]: Finished difference Result 5958 states and 7901 transitions. [2022-11-02 20:47:11,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:47:11,997 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 5 states have internal predecessors, (79), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 100 [2022-11-02 20:47:11,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:12,006 INFO L225 Difference]: With dead ends: 5958 [2022-11-02 20:47:12,006 INFO L226 Difference]: Without dead ends: 3051 [2022-11-02 20:47:12,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:47:12,013 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 783 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:12,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 1940 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:47:12,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3051 states. [2022-11-02 20:47:12,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3051 to 2913. [2022-11-02 20:47:12,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2913 states, 2631 states have (on average 1.3283922462941846) internal successors, (3495), 2656 states have internal predecessors, (3495), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2022-11-02 20:47:12,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2913 states to 2913 states and 3876 transitions. [2022-11-02 20:47:12,383 INFO L78 Accepts]: Start accepts. Automaton has 2913 states and 3876 transitions. Word has length 100 [2022-11-02 20:47:12,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:12,383 INFO L495 AbstractCegarLoop]: Abstraction has 2913 states and 3876 transitions. [2022-11-02 20:47:12,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 5 states have internal predecessors, (79), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-02 20:47:12,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2913 states and 3876 transitions. [2022-11-02 20:47:12,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-02 20:47:12,388 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:12,388 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:12,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:47:12,389 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:12,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:12,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1466210216, now seen corresponding path program 1 times [2022-11-02 20:47:12,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:12,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961269824] [2022-11-02 20:47:12,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:12,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:13,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:47:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:13,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:47:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:13,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:47:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:13,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:47:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:13,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-02 20:47:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:13,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:47:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:13,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-02 20:47:13,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:13,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-02 20:47:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:13,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:47:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:13,260 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:47:13,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:13,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961269824] [2022-11-02 20:47:13,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961269824] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:13,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342903681] [2022-11-02 20:47:13,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:13,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:13,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae882207-235e-4cd5-a29e-83b495fa9587/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:13,268 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae882207-235e-4cd5-a29e-83b495fa9587/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:47:13,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae882207-235e-4cd5-a29e-83b495fa9587/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:47:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:14,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 2108 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 20:47:14,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:14,349 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:47:14,349 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:47:14,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342903681] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:14,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:47:14,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2022-11-02 20:47:14,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065907563] [2022-11-02 20:47:14,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:14,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:47:14,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:14,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:47:14,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:47:14,353 INFO L87 Difference]: Start difference. First operand 2913 states and 3876 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 20:47:14,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:14,977 INFO L93 Difference]: Finished difference Result 5809 states and 7733 transitions. [2022-11-02 20:47:14,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:47:14,978 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 101 [2022-11-02 20:47:14,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:14,988 INFO L225 Difference]: With dead ends: 5809 [2022-11-02 20:47:14,988 INFO L226 Difference]: Without dead ends: 2908 [2022-11-02 20:47:14,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:47:14,994 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 2 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:14,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1877 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:47:14,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2022-11-02 20:47:15,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2908. [2022-11-02 20:47:15,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2908 states, 2628 states have (on average 1.3280060882800608) internal successors, (3490), 2652 states have internal predecessors, (3490), 159 states have call successors, (159), 90 states have call predecessors, (159), 120 states have return successors, (220), 177 states have call predecessors, (220), 157 states have call successors, (220) [2022-11-02 20:47:15,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2908 states to 2908 states and 3869 transitions. [2022-11-02 20:47:15,429 INFO L78 Accepts]: Start accepts. Automaton has 2908 states and 3869 transitions. Word has length 101 [2022-11-02 20:47:15,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:15,430 INFO L495 AbstractCegarLoop]: Abstraction has 2908 states and 3869 transitions. [2022-11-02 20:47:15,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 20:47:15,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2908 states and 3869 transitions. [2022-11-02 20:47:15,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-02 20:47:15,437 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:15,437 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:15,490 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae882207-235e-4cd5-a29e-83b495fa9587/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-02 20:47:15,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae882207-235e-4cd5-a29e-83b495fa9587/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 20:47:15,650 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:15,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:15,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1414387121, now seen corresponding path program 1 times [2022-11-02 20:47:15,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:15,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336856627] [2022-11-02 20:47:15,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:15,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:16,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:47:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:16,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:47:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:16,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 20:47:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:16,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:47:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:16,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:47:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:16,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:47:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:16,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:47:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:16,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-02 20:47:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:16,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:47:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:16,507 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:47:16,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:16,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336856627] [2022-11-02 20:47:16,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336856627] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:16,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028727065] [2022-11-02 20:47:16,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:16,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:16,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae882207-235e-4cd5-a29e-83b495fa9587/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:16,510 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae882207-235e-4cd5-a29e-83b495fa9587/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:47:16,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae882207-235e-4cd5-a29e-83b495fa9587/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:47:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:17,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 2155 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-02 20:47:17,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:47:17,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:47:17,947 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:47:17,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028727065] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:47:17,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:47:17,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 23 [2022-11-02 20:47:17,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849929740] [2022-11-02 20:47:17,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:47:17,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-02 20:47:17,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:17,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-02 20:47:17,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:47:17,950 INFO L87 Difference]: Start difference. First operand 2908 states and 3869 transitions. Second operand has 23 states, 23 states have (on average 4.782608695652174) internal successors, (110), 16 states have internal predecessors, (110), 5 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (15), 8 states have call predecessors, (15), 5 states have call successors, (15) [2022-11-02 20:47:21,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:21,714 INFO L93 Difference]: Finished difference Result 6365 states and 8552 transitions. [2022-11-02 20:47:21,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:47:21,715 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.782608695652174) internal successors, (110), 16 states have internal predecessors, (110), 5 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (15), 8 states have call predecessors, (15), 5 states have call successors, (15) Word has length 103 [2022-11-02 20:47:21,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:21,727 INFO L225 Difference]: With dead ends: 6365 [2022-11-02 20:47:21,727 INFO L226 Difference]: Without dead ends: 3473 [2022-11-02 20:47:21,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=166, Invalid=1394, Unknown=0, NotChecked=0, Total=1560 [2022-11-02 20:47:21,735 INFO L413 NwaCegarLoop]: 730 mSDtfsCounter, 2065 mSDsluCounter, 11038 mSDsCounter, 0 mSdLazyCounter, 2383 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2065 SdHoareTripleChecker+Valid, 11768 SdHoareTripleChecker+Invalid, 2609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 2383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:21,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2065 Valid, 11768 Invalid, 2609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 2383 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-02 20:47:21,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3473 states. [2022-11-02 20:47:21,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3473 to 2033. [2022-11-02 20:47:21,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2033 states, 1822 states have (on average 1.3117453347969266) internal successors, (2390), 1837 states have internal predecessors, (2390), 121 states have call successors, (121), 76 states have call predecessors, (121), 89 states have return successors, (153), 127 states have call predecessors, (153), 119 states have call successors, (153) [2022-11-02 20:47:21,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 2664 transitions. [2022-11-02 20:47:21,999 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 2664 transitions. Word has length 103 [2022-11-02 20:47:21,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:21,999 INFO L495 AbstractCegarLoop]: Abstraction has 2033 states and 2664 transitions. [2022-11-02 20:47:21,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.782608695652174) internal successors, (110), 16 states have internal predecessors, (110), 5 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (15), 8 states have call predecessors, (15), 5 states have call successors, (15) [2022-11-02 20:47:22,000 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 2664 transitions. [2022-11-02 20:47:22,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-02 20:47:22,003 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:22,003 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:22,052 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae882207-235e-4cd5-a29e-83b495fa9587/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:47:22,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae882207-235e-4cd5-a29e-83b495fa9587/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:22,219 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:47:22,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:22,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1722415670, now seen corresponding path program 1 times [2022-11-02 20:47:22,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:22,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971174634] [2022-11-02 20:47:22,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:22,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:22,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:47:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:22,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:47:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:22,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 20:47:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:22,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-02 20:47:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:22,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:47:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:22,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:47:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:22,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:47:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:22,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-02 20:47:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:22,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:47:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:47:22,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:22,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971174634] [2022-11-02 20:47:22,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971174634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:22,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:22,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:47:22,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032892401] [2022-11-02 20:47:22,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:22,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:47:22,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:22,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:47:22,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:47:22,940 INFO L87 Difference]: Start difference. First operand 2033 states and 2664 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 7 states have internal predecessors, (82), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-02 20:47:24,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:24,063 INFO L93 Difference]: Finished difference Result 2165 states and 2792 transitions. [2022-11-02 20:47:24,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:47:24,065 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 7 states have internal predecessors, (82), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 105 [2022-11-02 20:47:24,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:24,065 INFO L225 Difference]: With dead ends: 2165 [2022-11-02 20:47:24,065 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:47:24,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:47:24,071 INFO L413 NwaCegarLoop]: 355 mSDtfsCounter, 594 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:24,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 1627 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:47:24,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:47:24,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:47:24,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:47:24,080 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2022-11-02 20:47:24,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:24,080 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:47:24,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 7 states have internal predecessors, (82), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-02 20:47:24,082 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:47:24,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:47:24,087 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:47:24,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:47:24,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-02 20:47:43,666 WARN L234 SmtUtils]: Spent 7.95s on a formula simplification. DAG size of input: 73 DAG size of output: 61 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:48:04,828 WARN L234 SmtUtils]: Spent 7.47s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:48:11,514 WARN L234 SmtUtils]: Spent 6.68s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:48:19,477 WARN L234 SmtUtils]: Spent 7.96s on a formula simplification that was a NOOP. DAG size: 91 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:48:25,838 WARN L234 SmtUtils]: Spent 6.35s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:48:33,891 WARN L234 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:48:40,239 WARN L234 SmtUtils]: Spent 6.35s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:48:49,475 WARN L234 SmtUtils]: Spent 9.23s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:48:55,329 WARN L234 SmtUtils]: Spent 5.85s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:49:01,888 WARN L234 SmtUtils]: Spent 6.56s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:49:08,191 WARN L234 SmtUtils]: Spent 6.30s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:49:14,661 WARN L234 SmtUtils]: Spent 6.47s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:49:23,005 WARN L234 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 91 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:49:31,181 WARN L234 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:49:37,556 WARN L234 SmtUtils]: Spent 6.37s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:49:46,272 WARN L234 SmtUtils]: Spent 8.71s on a formula simplification that was a NOOP. DAG size: 90 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:49:55,644 WARN L234 SmtUtils]: Spent 9.37s on a formula simplification that was a NOOP. DAG size: 90 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:50:07,188 WARN L234 SmtUtils]: Spent 5.18s on a formula simplification. DAG size of input: 154 DAG size of output: 149 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:50:21,064 WARN L234 SmtUtils]: Spent 8.52s on a formula simplification. DAG size of input: 79 DAG size of output: 67 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)