./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--wireless--p54--p54usb.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ca16d11-788f-4edb-aa27-d20b4f089828/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ca16d11-788f-4edb-aa27-d20b4f089828/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_4ca16d11-788f-4edb-aa27-d20b4f089828/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ca16d11-788f-4edb-aa27-d20b4f089828/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--wireless--p54--p54usb.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ca16d11-788f-4edb-aa27-d20b4f089828/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_4ca16d11-788f-4edb-aa27-d20b4f089828/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 57d203c2bb9e5fb46a500992932f18e1bc69473edc196ab4ca3ccbbd153a7dab --- 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:42:25,364 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:42:25,367 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:42:25,429 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:42:25,430 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:42:25,431 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:42:25,433 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:42:25,435 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:42:25,437 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:42:25,438 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:42:25,439 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:42:25,441 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:42:25,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:42:25,443 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:42:25,444 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:42:25,445 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:42:25,447 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:42:25,448 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:42:25,450 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:42:25,452 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:42:25,454 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:42:25,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:42:25,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:42:25,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:42:25,463 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:42:25,463 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:42:25,464 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:42:25,465 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:42:25,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:42:25,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:42:25,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:42:25,469 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:42:25,470 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:42:25,482 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:42:25,484 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:42:25,484 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:42:25,485 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:42:25,486 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:42:25,486 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:42:25,487 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:42:25,488 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:42:25,490 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ca16d11-788f-4edb-aa27-d20b4f089828/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 20:42:25,540 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:42:25,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:42:25,541 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:42:25,541 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:42:25,542 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:42:25,542 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:42:25,549 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:42:25,549 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:42:25,549 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:42:25,550 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:42:25,551 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:42:25,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:42:25,552 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:42:25,552 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:42:25,552 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:42:25,553 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:42:25,553 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:42:25,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:42:25,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:42:25,554 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:42:25,554 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:42:25,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:42:25,555 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:42:25,555 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:42:25,556 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:42:25,556 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:42:25,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:42:25,558 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:42:25,558 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:42:25,559 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:42:25,559 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_4ca16d11-788f-4edb-aa27-d20b4f089828/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_4ca16d11-788f-4edb-aa27-d20b4f089828/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 -> 57d203c2bb9e5fb46a500992932f18e1bc69473edc196ab4ca3ccbbd153a7dab [2022-11-02 20:42:25,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:42:25,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:42:25,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:42:25,949 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:42:25,950 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:42:25,952 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ca16d11-788f-4edb-aa27-d20b4f089828/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--wireless--p54--p54usb.ko-entry_point.cil.out.i [2022-11-02 20:42:26,035 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ca16d11-788f-4edb-aa27-d20b4f089828/bin/uautomizer-Dbtcem3rbc/data/85be0cd24/11c7868b6d3d4318a4f12992e2e0f92b/FLAGd5909d306 [2022-11-02 20:42:27,132 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:42:27,134 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ca16d11-788f-4edb-aa27-d20b4f089828/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--wireless--p54--p54usb.ko-entry_point.cil.out.i [2022-11-02 20:42:27,191 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ca16d11-788f-4edb-aa27-d20b4f089828/bin/uautomizer-Dbtcem3rbc/data/85be0cd24/11c7868b6d3d4318a4f12992e2e0f92b/FLAGd5909d306 [2022-11-02 20:42:27,475 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ca16d11-788f-4edb-aa27-d20b4f089828/bin/uautomizer-Dbtcem3rbc/data/85be0cd24/11c7868b6d3d4318a4f12992e2e0f92b [2022-11-02 20:42:27,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:42:27,483 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:42:27,487 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:42:27,488 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:42:27,492 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:42:27,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:42:27" (1/1) ... [2022-11-02 20:42:27,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7622516a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:27, skipping insertion in model container [2022-11-02 20:42:27,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:42:27" (1/1) ... [2022-11-02 20:42:27,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:42:27,699 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:42:29,772 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_4ca16d11-788f-4edb-aa27-d20b4f089828/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--wireless--p54--p54usb.ko-entry_point.cil.out.i[258961,258974] [2022-11-02 20:42:30,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:42:30,106 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:42:30,562 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_4ca16d11-788f-4edb-aa27-d20b4f089828/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--wireless--p54--p54usb.ko-entry_point.cil.out.i[258961,258974] [2022-11-02 20:42:30,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:42:30,704 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:42:30,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:30 WrapperNode [2022-11-02 20:42:30,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:42:30,708 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:42:30,709 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:42:30,709 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:42:30,719 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:42:30" (1/1) ... [2022-11-02 20:42:30,836 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:42:30" (1/1) ... [2022-11-02 20:42:31,051 INFO L138 Inliner]: procedures = 217, calls = 1688, calls flagged for inlining = 75, calls inlined = 52, statements flattened = 3526 [2022-11-02 20:42:31,052 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:42:31,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:42:31,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:42:31,054 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:42:31,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:30" (1/1) ... [2022-11-02 20:42:31,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:30" (1/1) ... [2022-11-02 20:42:31,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:30" (1/1) ... [2022-11-02 20:42:31,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:30" (1/1) ... [2022-11-02 20:42:31,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:30" (1/1) ... [2022-11-02 20:42:31,250 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:30" (1/1) ... [2022-11-02 20:42:31,282 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:30" (1/1) ... [2022-11-02 20:42:31,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:30" (1/1) ... [2022-11-02 20:42:31,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:42:31,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:42:31,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:42:31,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:42:31,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:30" (1/1) ... [2022-11-02 20:42:31,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:42:31,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ca16d11-788f-4edb-aa27-d20b4f089828/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:31,390 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ca16d11-788f-4edb-aa27-d20b4f089828/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:31,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ca16d11-788f-4edb-aa27-d20b4f089828/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:42:31,451 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-11-02 20:42:31,452 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-11-02 20:42:31,452 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-11-02 20:42:31,452 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-11-02 20:42:31,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-02 20:42:31,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-02 20:42:31,453 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-02 20:42:31,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-02 20:42:31,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-02 20:42:31,453 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-02 20:42:31,454 INFO L130 BoogieDeclarations]: Found specification of procedure usb_put_dev [2022-11-02 20:42:31,454 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_put_dev [2022-11-02 20:42:31,454 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_dev [2022-11-02 20:42:31,454 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_dev [2022-11-02 20:42:31,454 INFO L130 BoogieDeclarations]: Found specification of procedure p54_free_common [2022-11-02 20:42:31,455 INFO L138 BoogieDeclarations]: Found implementation of procedure p54_free_common [2022-11-02 20:42:31,455 INFO L130 BoogieDeclarations]: Found specification of procedure p54u_stop [2022-11-02 20:42:31,455 INFO L138 BoogieDeclarations]: Found implementation of procedure p54u_stop [2022-11-02 20:42:31,455 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-02 20:42:31,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-02 20:42:31,455 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-11-02 20:42:31,456 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-11-02 20:42:31,456 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-02 20:42:31,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-02 20:42:31,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-02 20:42:31,456 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-02 20:42:31,456 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-02 20:42:31,457 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-02 20:42:31,457 INFO L130 BoogieDeclarations]: Found specification of procedure crc32_le [2022-11-02 20:42:31,457 INFO L138 BoogieDeclarations]: Found implementation of procedure crc32_le [2022-11-02 20:42:31,457 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-11-02 20:42:31,457 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-11-02 20:42:31,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:42:31,458 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-02 20:42:31,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:42:31,458 INFO L130 BoogieDeclarations]: Found specification of procedure p54_find_type [2022-11-02 20:42:31,458 INFO L138 BoogieDeclarations]: Found implementation of procedure p54_find_type [2022-11-02 20:42:31,458 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2022-11-02 20:42:31,459 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2022-11-02 20:42:31,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:42:31,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:42:31,460 INFO L130 BoogieDeclarations]: Found specification of procedure p54u_open [2022-11-02 20:42:31,460 INFO L138 BoogieDeclarations]: Found implementation of procedure p54u_open [2022-11-02 20:42:31,460 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-11-02 20:42:31,460 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-11-02 20:42:31,461 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2022-11-02 20:42:31,461 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2022-11-02 20:42:31,461 INFO L130 BoogieDeclarations]: Found specification of procedure p54u_post_reset [2022-11-02 20:42:31,461 INFO L138 BoogieDeclarations]: Found implementation of procedure p54u_post_reset [2022-11-02 20:42:31,461 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-11-02 20:42:31,462 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-11-02 20:42:31,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-02 20:42:31,462 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-11-02 20:42:31,462 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-11-02 20:42:31,463 INFO L130 BoogieDeclarations]: Found specification of procedure p54u_disconnect [2022-11-02 20:42:31,463 INFO L138 BoogieDeclarations]: Found implementation of procedure p54u_disconnect [2022-11-02 20:42:31,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-02 20:42:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2022-11-02 20:42:31,465 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2022-11-02 20:42:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:42:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_negative [2022-11-02 20:42:31,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_negative [2022-11-02 20:42:31,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-02 20:42:31,466 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-02 20:42:31,466 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-11-02 20:42:31,466 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-11-02 20:42:31,467 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-02 20:42:31,467 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-02 20:42:31,468 INFO L130 BoogieDeclarations]: Found specification of procedure __netdev_alloc_skb [2022-11-02 20:42:31,468 INFO L138 BoogieDeclarations]: Found implementation of procedure __netdev_alloc_skb [2022-11-02 20:42:31,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:42:31,468 INFO L130 BoogieDeclarations]: Found specification of procedure p54u_pre_reset [2022-11-02 20:42:31,469 INFO L138 BoogieDeclarations]: Found implementation of procedure p54u_pre_reset [2022-11-02 20:42:31,469 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-02 20:42:31,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-02 20:42:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-11-02 20:42:31,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-11-02 20:42:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:42:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:42:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure p54u_read [2022-11-02 20:42:31,471 INFO L138 BoogieDeclarations]: Found implementation of procedure p54u_read [2022-11-02 20:42:31,471 INFO L130 BoogieDeclarations]: Found specification of procedure p54u_write [2022-11-02 20:42:31,471 INFO L138 BoogieDeclarations]: Found implementation of procedure p54u_write [2022-11-02 20:42:31,471 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-02 20:42:31,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-02 20:42:31,471 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-11-02 20:42:31,472 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-11-02 20:42:31,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:42:31,472 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_udev_of_p54u_priv [2022-11-02 20:42:31,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_udev_of_p54u_priv [2022-11-02 20:42:31,473 INFO L130 BoogieDeclarations]: Found specification of procedure p54u_resume [2022-11-02 20:42:31,474 INFO L138 BoogieDeclarations]: Found implementation of procedure p54u_resume [2022-11-02 20:42:31,474 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-11-02 20:42:31,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-11-02 20:42:31,474 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-11-02 20:42:31,474 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-11-02 20:42:31,475 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_tail [2022-11-02 20:42:31,476 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_tail [2022-11-02 20:42:31,476 INFO L130 BoogieDeclarations]: Found specification of procedure p54u_free_urbs [2022-11-02 20:42:31,477 INFO L138 BoogieDeclarations]: Found implementation of procedure p54u_free_urbs [2022-11-02 20:42:31,477 INFO L130 BoogieDeclarations]: Found specification of procedure skb_unlink [2022-11-02 20:42:31,478 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_unlink [2022-11-02 20:42:31,478 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2022-11-02 20:42:31,478 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2022-11-02 20:42:31,478 INFO L130 BoogieDeclarations]: Found specification of procedure p54u_bulk_msg [2022-11-02 20:42:31,478 INFO L138 BoogieDeclarations]: Found implementation of procedure p54u_bulk_msg [2022-11-02 20:42:31,478 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2022-11-02 20:42:31,479 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2022-11-02 20:42:31,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:42:31,479 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-11-02 20:42:31,479 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-11-02 20:42:31,480 INFO L130 BoogieDeclarations]: Found specification of procedure skb_tail_pointer [2022-11-02 20:42:31,480 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_tail_pointer [2022-11-02 20:42:31,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:42:31,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:42:32,316 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:42:32,320 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:42:32,606 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-02 20:43:31,075 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:43:31,095 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:43:31,095 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:43:31,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:43:31 BoogieIcfgContainer [2022-11-02 20:43:31,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:43:31,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:43:31,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:43:31,109 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:43:31,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:42:27" (1/3) ... [2022-11-02 20:43:31,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3485dd5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:43:31, skipping insertion in model container [2022-11-02 20:43:31,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:30" (2/3) ... [2022-11-02 20:43:31,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3485dd5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:43:31, skipping insertion in model container [2022-11-02 20:43:31,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:43:31" (3/3) ... [2022-11-02 20:43:31,120 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--net--wireless--p54--p54usb.ko-entry_point.cil.out.i [2022-11-02 20:43:31,149 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:43:31,150 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:43:31,281 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:43:31,295 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;@25a285f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:43:31,295 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:43:31,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 729 states, 516 states have (on average 1.3468992248062015) internal successors, (695), 540 states have internal predecessors, (695), 163 states have call successors, (163), 49 states have call predecessors, (163), 48 states have return successors, (159), 159 states have call predecessors, (159), 159 states have call successors, (159) [2022-11-02 20:43:31,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 20:43:31,321 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:31,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:31,323 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:31,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:31,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1349896211, now seen corresponding path program 1 times [2022-11-02 20:43:31,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:31,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40073249] [2022-11-02 20:43:31,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:31,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:32,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:43:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:32,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:32,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:43:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:32,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:43:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:32,872 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:43:32,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:32,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40073249] [2022-11-02 20:43:32,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40073249] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:32,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:32,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:43:32,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663956103] [2022-11-02 20:43:32,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:32,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:43:32,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:32,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:43:32,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:43:32,972 INFO L87 Difference]: Start difference. First operand has 729 states, 516 states have (on average 1.3468992248062015) internal successors, (695), 540 states have internal predecessors, (695), 163 states have call successors, (163), 49 states have call predecessors, (163), 48 states have return successors, (159), 159 states have call predecessors, (159), 159 states have call successors, (159) Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:43:35,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:43:37,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:43:39,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:39,747 INFO L93 Difference]: Finished difference Result 1558 states and 2209 transitions. [2022-11-02 20:43:39,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:43:39,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2022-11-02 20:43:39,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:39,777 INFO L225 Difference]: With dead ends: 1558 [2022-11-02 20:43:39,777 INFO L226 Difference]: Without dead ends: 823 [2022-11-02 20:43:39,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:43:39,794 INFO L413 NwaCegarLoop]: 964 mSDtfsCounter, 471 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 445 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1995 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:39,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1995 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 447 Invalid, 2 Unknown, 0 Unchecked, 6.5s Time] [2022-11-02 20:43:39,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2022-11-02 20:43:39,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 718. [2022-11-02 20:43:39,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 511 states have (on average 1.3346379647749511) internal successors, (682), 529 states have internal predecessors, (682), 159 states have call successors, (159), 48 states have call predecessors, (159), 47 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2022-11-02 20:43:39,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 994 transitions. [2022-11-02 20:43:39,943 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 994 transitions. Word has length 39 [2022-11-02 20:43:39,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:39,944 INFO L495 AbstractCegarLoop]: Abstraction has 718 states and 994 transitions. [2022-11-02 20:43:39,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:43:39,944 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 994 transitions. [2022-11-02 20:43:39,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 20:43:39,947 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:39,947 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:39,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:43:39,948 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:39,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:39,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1859369301, now seen corresponding path program 1 times [2022-11-02 20:43:39,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:39,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124476652] [2022-11-02 20:43:39,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:39,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:41,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:43:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:41,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:41,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:43:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:41,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:43:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:41,183 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:43:41,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:41,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124476652] [2022-11-02 20:43:41,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124476652] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:41,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:41,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:43:41,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55513393] [2022-11-02 20:43:41,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:41,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:43:41,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:41,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:43:41,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:43:41,190 INFO L87 Difference]: Start difference. First operand 718 states and 994 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 20:43:43,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:43:45,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:43:49,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:49,631 INFO L93 Difference]: Finished difference Result 2329 states and 3239 transitions. [2022-11-02 20:43:49,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:43:49,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2022-11-02 20:43:49,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:49,648 INFO L225 Difference]: With dead ends: 2329 [2022-11-02 20:43:49,648 INFO L226 Difference]: Without dead ends: 1619 [2022-11-02 20:43:49,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:43:49,654 INFO L413 NwaCegarLoop]: 1066 mSDtfsCounter, 1820 mSDsluCounter, 1868 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 1003 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1911 SdHoareTripleChecker+Valid, 2934 SdHoareTripleChecker+Invalid, 1990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1003 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:49,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1911 Valid, 2934 Invalid, 1990 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1003 Valid, 985 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2022-11-02 20:43:49,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2022-11-02 20:43:49,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1405. [2022-11-02 20:43:49,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1001 states have (on average 1.3346653346653348) internal successors, (1336), 1032 states have internal predecessors, (1336), 309 states have call successors, (309), 95 states have call predecessors, (309), 94 states have return successors, (303), 303 states have call predecessors, (303), 303 states have call successors, (303) [2022-11-02 20:43:49,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 1948 transitions. [2022-11-02 20:43:49,801 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 1948 transitions. Word has length 39 [2022-11-02 20:43:49,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:49,801 INFO L495 AbstractCegarLoop]: Abstraction has 1405 states and 1948 transitions. [2022-11-02 20:43:49,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 20:43:49,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1948 transitions. [2022-11-02 20:43:49,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:43:49,805 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:49,806 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-02 20:43:49,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:43:49,806 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:49,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:49,807 INFO L85 PathProgramCache]: Analyzing trace with hash 950658258, now seen corresponding path program 1 times [2022-11-02 20:43:49,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:49,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128197757] [2022-11-02 20:43:49,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:49,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:50,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:43:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:50,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:50,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:43:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:50,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:43:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:50,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:43:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:50,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:50,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:43:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:50,779 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-02 20:43:50,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:50,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128197757] [2022-11-02 20:43:50,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128197757] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:50,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:50,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:43:50,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035059169] [2022-11-02 20:43:50,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:50,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:43:50,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:50,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:43:50,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:43:50,788 INFO L87 Difference]: Start difference. First operand 1405 states and 1948 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-02 20:43:52,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:43:54,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:43:56,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:43:59,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:59,753 INFO L93 Difference]: Finished difference Result 1637 states and 2275 transitions. [2022-11-02 20:43:59,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:43:59,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 59 [2022-11-02 20:43:59,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:59,765 INFO L225 Difference]: With dead ends: 1637 [2022-11-02 20:43:59,765 INFO L226 Difference]: Without dead ends: 1626 [2022-11-02 20:43:59,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:43:59,768 INFO L413 NwaCegarLoop]: 941 mSDtfsCounter, 1335 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 547 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1412 SdHoareTripleChecker+Valid, 2477 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 547 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:59,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1412 Valid, 2477 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [547 Valid, 607 Invalid, 3 Unknown, 0 Unchecked, 8.7s Time] [2022-11-02 20:43:59,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2022-11-02 20:43:59,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1405. [2022-11-02 20:43:59,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1001 states have (on average 1.3336663336663337) internal successors, (1335), 1032 states have internal predecessors, (1335), 309 states have call successors, (309), 95 states have call predecessors, (309), 94 states have return successors, (303), 303 states have call predecessors, (303), 303 states have call successors, (303) [2022-11-02 20:43:59,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 1947 transitions. [2022-11-02 20:43:59,880 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 1947 transitions. Word has length 59 [2022-11-02 20:43:59,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:59,881 INFO L495 AbstractCegarLoop]: Abstraction has 1405 states and 1947 transitions. [2022-11-02 20:43:59,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-02 20:43:59,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1947 transitions. [2022-11-02 20:43:59,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:43:59,884 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:59,885 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-02 20:43:59,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:43:59,886 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:59,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:59,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1007916560, now seen corresponding path program 1 times [2022-11-02 20:43:59,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:59,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941669929] [2022-11-02 20:43:59,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:59,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:00,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:44:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:00,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:00,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:44:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:00,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:44:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:00,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:44:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:00,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:00,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:44:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:00,935 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-02 20:44:00,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:00,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941669929] [2022-11-02 20:44:00,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941669929] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:00,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:00,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:44:00,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597555164] [2022-11-02 20:44:00,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:00,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:44:00,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:00,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:44:00,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:44:00,940 INFO L87 Difference]: Start difference. First operand 1405 states and 1947 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:44:03,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:44:05,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:44:07,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:07,130 INFO L93 Difference]: Finished difference Result 1617 states and 2249 transitions. [2022-11-02 20:44:07,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:44:07,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2022-11-02 20:44:07,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:07,144 INFO L225 Difference]: With dead ends: 1617 [2022-11-02 20:44:07,144 INFO L226 Difference]: Without dead ends: 1614 [2022-11-02 20:44:07,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:44:07,149 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 1392 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 582 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1468 SdHoareTripleChecker+Valid, 1937 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 582 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:07,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1468 Valid, 1937 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [582 Valid, 443 Invalid, 2 Unknown, 0 Unchecked, 6.0s Time] [2022-11-02 20:44:07,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2022-11-02 20:44:07,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1404. [2022-11-02 20:44:07,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1001 states have (on average 1.3326673326673326) internal successors, (1334), 1031 states have internal predecessors, (1334), 308 states have call successors, (308), 95 states have call predecessors, (308), 94 states have return successors, (303), 303 states have call predecessors, (303), 303 states have call successors, (303) [2022-11-02 20:44:07,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 1945 transitions. [2022-11-02 20:44:07,263 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 1945 transitions. Word has length 59 [2022-11-02 20:44:07,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:07,265 INFO L495 AbstractCegarLoop]: Abstraction has 1404 states and 1945 transitions. [2022-11-02 20:44:07,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:44:07,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1945 transitions. [2022-11-02 20:44:07,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-02 20:44:07,273 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:07,274 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-02 20:44:07,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:44:07,275 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:07,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:07,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1180428650, now seen corresponding path program 1 times [2022-11-02 20:44:07,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:07,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790328617] [2022-11-02 20:44:07,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:07,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:07,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:44:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:07,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:07,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:44:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:08,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:44:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:08,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:44:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:08,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:08,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:44:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:08,080 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-02 20:44:08,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:08,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790328617] [2022-11-02 20:44:08,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790328617] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:08,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:08,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:44:08,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824848432] [2022-11-02 20:44:08,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:08,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:44:08,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:08,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:44:08,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:44:08,085 INFO L87 Difference]: Start difference. First operand 1404 states and 1945 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:44:10,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:44:12,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:44:14,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:14,789 INFO L93 Difference]: Finished difference Result 1616 states and 2247 transitions. [2022-11-02 20:44:14,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:44:14,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2022-11-02 20:44:14,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:14,801 INFO L225 Difference]: With dead ends: 1616 [2022-11-02 20:44:14,801 INFO L226 Difference]: Without dead ends: 1613 [2022-11-02 20:44:14,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:44:14,804 INFO L413 NwaCegarLoop]: 922 mSDtfsCounter, 1315 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 541 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1390 SdHoareTripleChecker+Valid, 2416 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 541 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:14,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1390 Valid, 2416 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [541 Valid, 607 Invalid, 2 Unknown, 0 Unchecked, 6.5s Time] [2022-11-02 20:44:14,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2022-11-02 20:44:14,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 1403. [2022-11-02 20:44:14,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1403 states, 1001 states have (on average 1.3316683316683318) internal successors, (1333), 1030 states have internal predecessors, (1333), 307 states have call successors, (307), 95 states have call predecessors, (307), 94 states have return successors, (303), 303 states have call predecessors, (303), 303 states have call successors, (303) [2022-11-02 20:44:14,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1403 states and 1943 transitions. [2022-11-02 20:44:14,974 INFO L78 Accepts]: Start accepts. Automaton has 1403 states and 1943 transitions. Word has length 60 [2022-11-02 20:44:14,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:14,976 INFO L495 AbstractCegarLoop]: Abstraction has 1403 states and 1943 transitions. [2022-11-02 20:44:14,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:44:14,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 1943 transitions. [2022-11-02 20:44:14,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-02 20:44:14,979 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:14,979 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-02 20:44:14,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:44:14,980 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:14,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:14,981 INFO L85 PathProgramCache]: Analyzing trace with hash -2061626285, now seen corresponding path program 1 times [2022-11-02 20:44:14,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:14,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101462370] [2022-11-02 20:44:14,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:14,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:15,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:44:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:15,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:15,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:44:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:15,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:44:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:15,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:44:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:15,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:15,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:44:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:15,825 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-02 20:44:15,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:15,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101462370] [2022-11-02 20:44:15,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101462370] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:15,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:15,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:44:15,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109760325] [2022-11-02 20:44:15,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:15,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:44:15,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:15,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:44:15,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:44:15,828 INFO L87 Difference]: Start difference. First operand 1403 states and 1943 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:44:17,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:44:19,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:19,703 INFO L93 Difference]: Finished difference Result 1615 states and 2245 transitions. [2022-11-02 20:44:19,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:44:19,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2022-11-02 20:44:19,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:19,714 INFO L225 Difference]: With dead ends: 1615 [2022-11-02 20:44:19,714 INFO L226 Difference]: Without dead ends: 1612 [2022-11-02 20:44:19,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:44:19,717 INFO L413 NwaCegarLoop]: 919 mSDtfsCounter, 1388 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 581 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1463 SdHoareTripleChecker+Valid, 1929 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 581 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:19,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1463 Valid, 1929 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [581 Valid, 444 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-11-02 20:44:19,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2022-11-02 20:44:19,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1402. [2022-11-02 20:44:19,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1001 states have (on average 1.3306693306693307) internal successors, (1332), 1029 states have internal predecessors, (1332), 306 states have call successors, (306), 95 states have call predecessors, (306), 94 states have return successors, (303), 303 states have call predecessors, (303), 303 states have call successors, (303) [2022-11-02 20:44:19,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1941 transitions. [2022-11-02 20:44:19,825 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1941 transitions. Word has length 61 [2022-11-02 20:44:19,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:19,826 INFO L495 AbstractCegarLoop]: Abstraction has 1402 states and 1941 transitions. [2022-11-02 20:44:19,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:44:19,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1941 transitions. [2022-11-02 20:44:19,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 20:44:19,828 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:19,828 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-02 20:44:19,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:44:19,828 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:19,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:19,829 INFO L85 PathProgramCache]: Analyzing trace with hash 513890701, now seen corresponding path program 1 times [2022-11-02 20:44:19,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:19,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754281297] [2022-11-02 20:44:19,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:19,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:20,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:44:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:20,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:20,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:44:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:20,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:44:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:20,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:44:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:20,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:20,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:44:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:20,566 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-02 20:44:20,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:20,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754281297] [2022-11-02 20:44:20,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754281297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:20,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:20,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:44:20,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925470740] [2022-11-02 20:44:20,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:20,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:44:20,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:20,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:44:20,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:44:20,569 INFO L87 Difference]: Start difference. First operand 1402 states and 1941 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:44:22,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:44:24,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:44:28,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:28,473 INFO L93 Difference]: Finished difference Result 4572 states and 6368 transitions. [2022-11-02 20:44:28,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:44:28,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2022-11-02 20:44:28,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:28,498 INFO L225 Difference]: With dead ends: 4572 [2022-11-02 20:44:28,498 INFO L226 Difference]: Without dead ends: 3180 [2022-11-02 20:44:28,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:44:28,508 INFO L413 NwaCegarLoop]: 1074 mSDtfsCounter, 1689 mSDsluCounter, 2412 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 935 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1780 SdHoareTripleChecker+Valid, 3486 SdHoareTripleChecker+Invalid, 2133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:28,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1780 Valid, 3486 Invalid, 2133 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [935 Valid, 1196 Invalid, 2 Unknown, 0 Unchecked, 7.5s Time] [2022-11-02 20:44:28,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3180 states. [2022-11-02 20:44:28,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3180 to 2755. [2022-11-02 20:44:28,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2755 states, 1965 states have (on average 1.3338422391857507) internal successors, (2621), 2019 states have internal predecessors, (2621), 605 states have call successors, (605), 187 states have call predecessors, (605), 184 states have return successors, (602), 600 states have call predecessors, (602), 602 states have call successors, (602) [2022-11-02 20:44:28,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2755 states to 2755 states and 3828 transitions. [2022-11-02 20:44:28,723 INFO L78 Accepts]: Start accepts. Automaton has 2755 states and 3828 transitions. Word has length 62 [2022-11-02 20:44:28,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:28,723 INFO L495 AbstractCegarLoop]: Abstraction has 2755 states and 3828 transitions. [2022-11-02 20:44:28,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:44:28,724 INFO L276 IsEmpty]: Start isEmpty. Operand 2755 states and 3828 transitions. [2022-11-02 20:44:28,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-02 20:44:28,727 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:28,727 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2022-11-02 20:44:28,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:44:28,728 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:28,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:28,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1643939959, now seen corresponding path program 1 times [2022-11-02 20:44:28,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:28,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923952626] [2022-11-02 20:44:28,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:28,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:29,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:44:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:29,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:29,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:44:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:29,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:44:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:29,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 20:44:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:29,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:44:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:29,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-02 20:44:29,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:29,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:44:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:29,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:44:29,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:29,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:44:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:29,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:44:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:29,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-02 20:44:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:29,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 20:44:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:29,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:29,523 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-02 20:44:29,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:29,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923952626] [2022-11-02 20:44:29,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923952626] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:29,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:29,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:44:29,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278298991] [2022-11-02 20:44:29,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:29,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:44:29,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:29,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:44:29,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:44:29,527 INFO L87 Difference]: Start difference. First operand 2755 states and 3828 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-02 20:44:31,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:44:33,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:44:36,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:36,084 INFO L93 Difference]: Finished difference Result 6206 states and 8670 transitions. [2022-11-02 20:44:36,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:44:36,085 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 104 [2022-11-02 20:44:36,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:36,104 INFO L225 Difference]: With dead ends: 6206 [2022-11-02 20:44:36,104 INFO L226 Difference]: Without dead ends: 3469 [2022-11-02 20:44:36,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:44:36,115 INFO L413 NwaCegarLoop]: 950 mSDtfsCounter, 747 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 680 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 2792 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 680 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:36,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 2792 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [680 Valid, 817 Invalid, 2 Unknown, 0 Unchecked, 6.1s Time] [2022-11-02 20:44:36,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3469 states. [2022-11-02 20:44:36,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3469 to 2813. [2022-11-02 20:44:36,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2813 states, 2021 states have (on average 1.335477486392875) internal successors, (2699), 2075 states have internal predecessors, (2699), 605 states have call successors, (605), 189 states have call predecessors, (605), 186 states have return successors, (602), 600 states have call predecessors, (602), 602 states have call successors, (602) [2022-11-02 20:44:36,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2813 states to 2813 states and 3906 transitions. [2022-11-02 20:44:36,330 INFO L78 Accepts]: Start accepts. Automaton has 2813 states and 3906 transitions. Word has length 104 [2022-11-02 20:44:36,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:36,332 INFO L495 AbstractCegarLoop]: Abstraction has 2813 states and 3906 transitions. [2022-11-02 20:44:36,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-02 20:44:36,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 3906 transitions. [2022-11-02 20:44:36,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-11-02 20:44:36,336 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:36,337 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:36,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:44:36,337 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:36,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:36,338 INFO L85 PathProgramCache]: Analyzing trace with hash -832428614, now seen corresponding path program 1 times [2022-11-02 20:44:36,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:36,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192160718] [2022-11-02 20:44:36,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:36,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:37,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:44:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:37,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:37,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:44:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:37,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:44:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:37,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:44:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:37,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:37,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:44:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:37,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:44:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:37,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:44:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:37,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-02 20:44:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:37,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 20:44:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:37,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 20:44:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:37,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 20:44:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:37,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-02 20:44:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:37,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:44:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:37,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-02 20:44:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:37,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:37,266 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-02 20:44:37,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:37,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192160718] [2022-11-02 20:44:37,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192160718] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:37,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:37,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:44:37,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492694998] [2022-11-02 20:44:37,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:37,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:44:37,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:37,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:44:37,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:44:37,270 INFO L87 Difference]: Start difference. First operand 2813 states and 3906 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2022-11-02 20:44:39,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:44:41,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:44:44,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:44,495 INFO L93 Difference]: Finished difference Result 6780 states and 9559 transitions. [2022-11-02 20:44:44,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:44:44,496 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2022-11-02 20:44:44,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:44,523 INFO L225 Difference]: With dead ends: 6780 [2022-11-02 20:44:44,523 INFO L226 Difference]: Without dead ends: 3993 [2022-11-02 20:44:44,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:44:44,542 INFO L413 NwaCegarLoop]: 1137 mSDtfsCounter, 987 mSDsluCounter, 2124 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 842 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 3261 SdHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 842 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:44,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 3261 Invalid, 1648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [842 Valid, 804 Invalid, 2 Unknown, 0 Unchecked, 6.7s Time] [2022-11-02 20:44:44,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3993 states. [2022-11-02 20:44:44,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3993 to 2825. [2022-11-02 20:44:44,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2825 states, 2033 states have (on average 1.3334972946384653) internal successors, (2711), 2087 states have internal predecessors, (2711), 605 states have call successors, (605), 189 states have call predecessors, (605), 186 states have return successors, (602), 600 states have call predecessors, (602), 602 states have call successors, (602) [2022-11-02 20:44:44,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 3918 transitions. [2022-11-02 20:44:44,809 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 3918 transitions. Word has length 133 [2022-11-02 20:44:44,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:44,810 INFO L495 AbstractCegarLoop]: Abstraction has 2825 states and 3918 transitions. [2022-11-02 20:44:44,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2022-11-02 20:44:44,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 3918 transitions. [2022-11-02 20:44:44,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-11-02 20:44:44,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:44,816 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:44,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:44:44,816 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:44,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:44,817 INFO L85 PathProgramCache]: Analyzing trace with hash -780408024, now seen corresponding path program 1 times [2022-11-02 20:44:44,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:44,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603887389] [2022-11-02 20:44:44,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:44,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:45,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:44:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:45,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:45,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:44:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:45,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:44:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:45,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:44:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:45,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:45,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:44:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:45,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:44:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:45,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:44:45,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:45,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-02 20:44:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:45,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 20:44:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:45,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 20:44:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:45,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 20:44:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:45,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-02 20:44:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:45,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:44:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:45,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-02 20:44:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:45,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:45,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-02 20:44:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:45,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:44:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:45,662 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-02 20:44:45,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:45,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603887389] [2022-11-02 20:44:45,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603887389] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:45,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:45,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:44:45,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789200184] [2022-11-02 20:44:45,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:45,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:44:45,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:45,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:44:45,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:44:45,665 INFO L87 Difference]: Start difference. First operand 2825 states and 3918 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2022-11-02 20:44:47,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:44:49,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:44:51,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:44:53,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:45:01,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:01,486 INFO L93 Difference]: Finished difference Result 6269 states and 8750 transitions. [2022-11-02 20:45:01,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:45:01,487 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 149 [2022-11-02 20:45:01,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:01,511 INFO L225 Difference]: With dead ends: 6269 [2022-11-02 20:45:01,511 INFO L226 Difference]: Without dead ends: 3470 [2022-11-02 20:45:01,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:45:01,524 INFO L413 NwaCegarLoop]: 1587 mSDtfsCounter, 2029 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 3711 mSolverCounterSat, 1642 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2158 SdHoareTripleChecker+Valid, 2646 SdHoareTripleChecker+Invalid, 5357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1642 IncrementalHoareTripleChecker+Valid, 3711 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:01,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2158 Valid, 2646 Invalid, 5357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1642 Valid, 3711 Invalid, 4 Unknown, 0 Unchecked, 15.1s Time] [2022-11-02 20:45:01,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3470 states. [2022-11-02 20:45:01,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3470 to 2822. [2022-11-02 20:45:01,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2822 states, 2031 states have (on average 1.3318562284588873) internal successors, (2705), 2085 states have internal predecessors, (2705), 604 states have call successors, (604), 188 states have call predecessors, (604), 186 states have return successors, (600), 600 states have call predecessors, (600), 600 states have call successors, (600) [2022-11-02 20:45:01,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 3909 transitions. [2022-11-02 20:45:01,791 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 3909 transitions. Word has length 149 [2022-11-02 20:45:01,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:01,792 INFO L495 AbstractCegarLoop]: Abstraction has 2822 states and 3909 transitions. [2022-11-02 20:45:01,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2022-11-02 20:45:01,792 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 3909 transitions. [2022-11-02 20:45:01,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-11-02 20:45:01,798 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:01,798 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:01,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:45:01,799 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:45:01,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:01,799 INFO L85 PathProgramCache]: Analyzing trace with hash 130040048, now seen corresponding path program 1 times [2022-11-02 20:45:01,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:01,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766829222] [2022-11-02 20:45:01,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:01,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:03,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:45:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:03,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:03,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:03,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:45:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:03,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:45:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:03,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:03,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:03,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:45:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:03,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:45:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:03,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-02 20:45:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:03,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 20:45:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:03,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 20:45:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:03,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 20:45:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:03,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-02 20:45:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:03,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:45:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:03,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-02 20:45:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:03,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:03,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-02 20:45:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:03,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:45:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:04,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:04,053 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 20:45:04,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:04,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766829222] [2022-11-02 20:45:04,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766829222] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:04,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:04,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:45:04,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101597803] [2022-11-02 20:45:04,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:04,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:45:04,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:04,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:45:04,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:45:04,057 INFO L87 Difference]: Start difference. First operand 2822 states and 3909 transitions. Second operand has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 7 states have internal predecessors, (91), 2 states have call successors, (19), 6 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2022-11-02 20:45:06,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:45:08,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:45:10,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:45:15,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:15,806 INFO L93 Difference]: Finished difference Result 7589 states and 10796 transitions. [2022-11-02 20:45:15,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:45:15,807 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 7 states have internal predecessors, (91), 2 states have call successors, (19), 6 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) Word has length 154 [2022-11-02 20:45:15,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:15,830 INFO L225 Difference]: With dead ends: 7589 [2022-11-02 20:45:15,830 INFO L226 Difference]: Without dead ends: 4793 [2022-11-02 20:45:15,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:45:15,841 INFO L413 NwaCegarLoop]: 1323 mSDtfsCounter, 1259 mSDsluCounter, 8312 mSDsCounter, 0 mSdLazyCounter, 3029 mSolverCounterSat, 617 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1316 SdHoareTripleChecker+Valid, 9635 SdHoareTripleChecker+Invalid, 3649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 617 IncrementalHoareTripleChecker+Valid, 3029 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:15,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1316 Valid, 9635 Invalid, 3649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [617 Valid, 3029 Invalid, 3 Unknown, 0 Unchecked, 11.1s Time] [2022-11-02 20:45:15,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4793 states. [2022-11-02 20:45:16,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4793 to 2819. [2022-11-02 20:45:16,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2819 states, 2029 states have (on average 1.3302119270576638) internal successors, (2699), 2082 states have internal predecessors, (2699), 603 states have call successors, (603), 188 states have call predecessors, (603), 186 states have return successors, (600), 600 states have call predecessors, (600), 600 states have call successors, (600) [2022-11-02 20:45:16,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 3902 transitions. [2022-11-02 20:45:16,154 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 3902 transitions. Word has length 154 [2022-11-02 20:45:16,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:16,155 INFO L495 AbstractCegarLoop]: Abstraction has 2819 states and 3902 transitions. [2022-11-02 20:45:16,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 7 states have internal predecessors, (91), 2 states have call successors, (19), 6 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2022-11-02 20:45:16,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 3902 transitions. [2022-11-02 20:45:16,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-11-02 20:45:16,163 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:16,163 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:16,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:45:16,164 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:45:16,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:16,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1003086829, now seen corresponding path program 1 times [2022-11-02 20:45:16,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:16,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007866238] [2022-11-02 20:45:16,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:16,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:16,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:45:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:17,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:17,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:17,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:45:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:17,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:45:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:17,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:17,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:17,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:45:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:17,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:45:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:17,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-02 20:45:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:17,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 20:45:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:17,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 20:45:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:17,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 20:45:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:17,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-02 20:45:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:17,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:45:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:17,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-02 20:45:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:17,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:17,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-02 20:45:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:17,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:45:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:17,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-02 20:45:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:17,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-02 20:45:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:17,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-02 20:45:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:17,255 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-02 20:45:17,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:17,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007866238] [2022-11-02 20:45:17,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007866238] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:17,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:17,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:45:17,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641165412] [2022-11-02 20:45:17,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:17,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:45:17,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:17,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:45:17,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:45:17,258 INFO L87 Difference]: Start difference. First operand 2819 states and 3902 transitions. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (21), 7 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2022-11-02 20:45:19,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:45:21,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:45:23,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:45:25,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:45:29,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:29,441 INFO L93 Difference]: Finished difference Result 6279 states and 8757 transitions. [2022-11-02 20:45:29,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:45:29,441 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (21), 7 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 184 [2022-11-02 20:45:29,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:29,469 INFO L225 Difference]: With dead ends: 6279 [2022-11-02 20:45:29,469 INFO L226 Difference]: Without dead ends: 3486 [2022-11-02 20:45:29,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:45:29,479 INFO L413 NwaCegarLoop]: 846 mSDtfsCounter, 1111 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 2794 mSolverCounterSat, 750 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 3548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 750 IncrementalHoareTripleChecker+Valid, 2794 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:29,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1208 Valid, 1699 Invalid, 3548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [750 Valid, 2794 Invalid, 4 Unknown, 0 Unchecked, 11.8s Time] [2022-11-02 20:45:29,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3486 states. [2022-11-02 20:45:29,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3486 to 2835. [2022-11-02 20:45:29,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2835 states, 2045 states have (on average 1.3295843520782396) internal successors, (2719), 2098 states have internal predecessors, (2719), 603 states have call successors, (603), 188 states have call predecessors, (603), 186 states have return successors, (600), 600 states have call predecessors, (600), 600 states have call successors, (600) [2022-11-02 20:45:29,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2835 states to 2835 states and 3922 transitions. [2022-11-02 20:45:29,733 INFO L78 Accepts]: Start accepts. Automaton has 2835 states and 3922 transitions. Word has length 184 [2022-11-02 20:45:29,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:29,734 INFO L495 AbstractCegarLoop]: Abstraction has 2835 states and 3922 transitions. [2022-11-02 20:45:29,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (21), 7 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2022-11-02 20:45:29,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2835 states and 3922 transitions. [2022-11-02 20:45:29,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-11-02 20:45:29,740 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:29,740 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:29,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:45:29,741 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:45:29,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:29,742 INFO L85 PathProgramCache]: Analyzing trace with hash 632692563, now seen corresponding path program 1 times [2022-11-02 20:45:29,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:29,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648170919] [2022-11-02 20:45:29,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:29,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:30,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:45:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:30,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:30,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:30,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:45:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:30,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:45:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:30,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:30,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:30,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:45:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:45:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-02 20:45:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 20:45:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 20:45:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 20:45:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-02 20:45:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:45:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-02 20:45:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-02 20:45:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:45:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-02 20:45:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-02 20:45:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-02 20:45:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,312 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-02 20:45:31,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:31,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648170919] [2022-11-02 20:45:31,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648170919] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:31,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:31,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:45:31,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362729505] [2022-11-02 20:45:31,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:31,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:45:31,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:31,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:45:31,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:45:31,315 INFO L87 Difference]: Start difference. First operand 2835 states and 3922 transitions. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 5 states have internal predecessors, (117), 2 states have call successors, (21), 7 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2022-11-02 20:45:33,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:45:35,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:45:37,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:45:39,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:45:45,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:45,829 INFO L93 Difference]: Finished difference Result 6877 states and 9652 transitions. [2022-11-02 20:45:45,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:45:45,830 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 5 states have internal predecessors, (117), 2 states have call successors, (21), 7 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 186 [2022-11-02 20:45:45,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:45,846 INFO L225 Difference]: With dead ends: 6877 [2022-11-02 20:45:45,846 INFO L226 Difference]: Without dead ends: 4068 [2022-11-02 20:45:45,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:45:45,857 INFO L413 NwaCegarLoop]: 1041 mSDtfsCounter, 1363 mSDsluCounter, 2582 mSDsCounter, 0 mSdLazyCounter, 5540 mSolverCounterSat, 916 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 3623 SdHoareTripleChecker+Invalid, 6460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 916 IncrementalHoareTripleChecker+Valid, 5540 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:45,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1492 Valid, 3623 Invalid, 6460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [916 Valid, 5540 Invalid, 4 Unknown, 0 Unchecked, 14.0s Time] [2022-11-02 20:45:45,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4068 states. [2022-11-02 20:45:46,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4068 to 2851. [2022-11-02 20:45:46,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2057 states have (on average 1.3276616431696646) internal successors, (2731), 2110 states have internal predecessors, (2731), 603 states have call successors, (603), 188 states have call predecessors, (603), 190 states have return successors, (604), 604 states have call predecessors, (604), 600 states have call successors, (604) [2022-11-02 20:45:46,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 3938 transitions. [2022-11-02 20:45:46,210 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 3938 transitions. Word has length 186 [2022-11-02 20:45:46,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:46,210 INFO L495 AbstractCegarLoop]: Abstraction has 2851 states and 3938 transitions. [2022-11-02 20:45:46,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 5 states have internal predecessors, (117), 2 states have call successors, (21), 7 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2022-11-02 20:45:46,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 3938 transitions. [2022-11-02 20:45:46,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-11-02 20:45:46,216 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:46,217 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:46,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:45:46,217 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:45:46,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:46,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1639305554, now seen corresponding path program 1 times [2022-11-02 20:45:46,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:46,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205769951] [2022-11-02 20:45:46,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:46,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:45:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:45:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:45:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:45:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:45:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-02 20:45:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 20:45:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 20:45:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 20:45:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-02 20:45:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:45:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-02 20:45:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:47,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-02 20:45:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:45:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-02 20:45:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-02 20:45:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-02 20:45:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:47,381 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-02 20:45:47,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:47,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205769951] [2022-11-02 20:45:47,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205769951] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:45:47,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343507971] [2022-11-02 20:45:47,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:47,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:47,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ca16d11-788f-4edb-aa27-d20b4f089828/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:47,392 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ca16d11-788f-4edb-aa27-d20b4f089828/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:47,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ca16d11-788f-4edb-aa27-d20b4f089828/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:45:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:49,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 5407 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:45:49,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:49,538 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-02 20:45:49,538 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:45:49,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343507971] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:49,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:45:49,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2022-11-02 20:45:49,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511855304] [2022-11-02 20:45:49,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:49,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:45:49,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:49,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:45:49,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:45:49,540 INFO L87 Difference]: Start difference. First operand 2851 states and 3938 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-02 20:45:50,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:50,090 INFO L93 Difference]: Finished difference Result 5871 states and 8273 transitions. [2022-11-02 20:45:50,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:45:50,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 187 [2022-11-02 20:45:50,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:50,107 INFO L225 Difference]: With dead ends: 5871 [2022-11-02 20:45:50,107 INFO L226 Difference]: Without dead ends: 4470 [2022-11-02 20:45:50,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:45:50,113 INFO L413 NwaCegarLoop]: 1327 mSDtfsCounter, 668 mSDsluCounter, 3499 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 4826 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:50,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 4826 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:45:50,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4470 states. [2022-11-02 20:45:50,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4470 to 2851. [2022-11-02 20:45:50,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2057 states have (on average 1.3266893534273214) internal successors, (2729), 2110 states have internal predecessors, (2729), 603 states have call successors, (603), 188 states have call predecessors, (603), 190 states have return successors, (604), 604 states have call predecessors, (604), 600 states have call successors, (604) [2022-11-02 20:45:50,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 3936 transitions. [2022-11-02 20:45:50,397 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 3936 transitions. Word has length 187 [2022-11-02 20:45:50,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:50,398 INFO L495 AbstractCegarLoop]: Abstraction has 2851 states and 3936 transitions. [2022-11-02 20:45:50,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-02 20:45:50,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 3936 transitions. [2022-11-02 20:45:50,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-11-02 20:45:50,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:50,405 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:50,451 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ca16d11-788f-4edb-aa27-d20b4f089828/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:45:50,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ca16d11-788f-4edb-aa27-d20b4f089828/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-02 20:45:50,629 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:45:50,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:50,629 INFO L85 PathProgramCache]: Analyzing trace with hash -455136561, now seen corresponding path program 1 times [2022-11-02 20:45:50,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:50,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241998360] [2022-11-02 20:45:50,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:50,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:45:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:45:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:45:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:45:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:45:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-02 20:45:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 20:45:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 20:45:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 20:45:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-02 20:45:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:45:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-02 20:45:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-02 20:45:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:45:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-02 20:45:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-02 20:45:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-02 20:45:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,474 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-02 20:45:51,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:51,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241998360] [2022-11-02 20:45:51,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241998360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:51,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:51,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:45:51,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226437967] [2022-11-02 20:45:51,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:51,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:45:51,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:51,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:45:51,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:45:51,477 INFO L87 Difference]: Start difference. First operand 2851 states and 3936 transitions. Second operand has 8 states, 8 states have (on average 15.375) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (21), 7 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-11-02 20:45:53,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:45:55,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:45:57,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:46:01,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:01,498 INFO L93 Difference]: Finished difference Result 3438 states and 4820 transitions. [2022-11-02 20:46:01,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:46:01,499 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.375) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (21), 7 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 192 [2022-11-02 20:46:01,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:01,499 INFO L225 Difference]: With dead ends: 3438 [2022-11-02 20:46:01,499 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:46:01,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:46:01,509 INFO L413 NwaCegarLoop]: 1010 mSDtfsCounter, 1525 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 1118 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1651 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 3387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1118 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:01,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1651 Valid, 2048 Invalid, 3387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1118 Valid, 2266 Invalid, 3 Unknown, 0 Unchecked, 9.7s Time] [2022-11-02 20:46:01,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:46:01,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:46:01,510 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:46:01,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:46:01,511 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 192 [2022-11-02 20:46:01,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:01,511 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:46:01,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.375) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (21), 7 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-11-02 20:46:01,512 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:46:01,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:46:01,514 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:46:01,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:46:01,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.