./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--hwmon--abituguru3.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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64887294-b4a3-4080-93b9-5526b7102894/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64887294-b4a3-4080-93b9-5526b7102894/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_64887294-b4a3-4080-93b9-5526b7102894/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64887294-b4a3-4080-93b9-5526b7102894/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru3.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64887294-b4a3-4080-93b9-5526b7102894/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_64887294-b4a3-4080-93b9-5526b7102894/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 32c3d0de0693c88d7932ff8b6e02d1235a8aa90cfbd4ebc203b8adf917998be1 --- 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:43:24,324 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:43:24,327 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:43:24,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:43:24,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:43:24,386 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:43:24,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:43:24,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:43:24,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:43:24,401 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:43:24,402 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:43:24,404 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:43:24,404 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:43:24,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:43:24,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:43:24,409 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:43:24,410 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:43:24,411 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:43:24,412 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:43:24,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:43:24,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:43:24,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:43:24,418 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:43:24,419 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:43:24,423 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:43:24,423 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:43:24,423 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:43:24,424 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:43:24,425 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:43:24,426 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:43:24,426 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:43:24,427 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:43:24,428 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:43:24,429 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:43:24,430 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:43:24,430 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:43:24,431 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:43:24,431 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:43:24,431 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:43:24,432 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:43:24,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:43:24,434 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64887294-b4a3-4080-93b9-5526b7102894/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 20:43:24,455 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:43:24,456 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:43:24,456 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:43:24,456 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:43:24,457 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:43:24,457 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:43:24,458 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:43:24,458 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:43:24,459 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:43:24,459 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:43:24,459 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:43:24,460 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:43:24,460 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:43:24,460 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:43:24,460 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:43:24,461 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:43:24,461 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:43:24,461 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:43:24,461 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:43:24,462 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:43:24,462 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:43:24,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:43:24,463 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:43:24,463 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:43:24,463 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:43:24,463 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:43:24,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:43:24,464 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:43:24,464 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:43:24,464 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:43:24,464 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_64887294-b4a3-4080-93b9-5526b7102894/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_64887294-b4a3-4080-93b9-5526b7102894/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 -> 32c3d0de0693c88d7932ff8b6e02d1235a8aa90cfbd4ebc203b8adf917998be1 [2022-11-02 20:43:24,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:43:24,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:43:24,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:43:24,823 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:43:24,825 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:43:24,826 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64887294-b4a3-4080-93b9-5526b7102894/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru3.ko-entry_point.cil.out.i [2022-11-02 20:43:24,915 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64887294-b4a3-4080-93b9-5526b7102894/bin/uautomizer-Dbtcem3rbc/data/14aacb6d9/415830da29e143d0a698fc61c183288e/FLAGf767018d1 [2022-11-02 20:43:25,736 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:43:25,738 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64887294-b4a3-4080-93b9-5526b7102894/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru3.ko-entry_point.cil.out.i [2022-11-02 20:43:25,780 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64887294-b4a3-4080-93b9-5526b7102894/bin/uautomizer-Dbtcem3rbc/data/14aacb6d9/415830da29e143d0a698fc61c183288e/FLAGf767018d1 [2022-11-02 20:43:26,268 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64887294-b4a3-4080-93b9-5526b7102894/bin/uautomizer-Dbtcem3rbc/data/14aacb6d9/415830da29e143d0a698fc61c183288e [2022-11-02 20:43:26,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:43:26,273 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:43:26,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:43:26,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:43:26,285 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:43:26,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:43:26" (1/1) ... [2022-11-02 20:43:26,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@167d7bab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:26, skipping insertion in model container [2022-11-02 20:43:26,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:43:26" (1/1) ... [2022-11-02 20:43:26,295 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:43:26,435 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:43:27,662 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_64887294-b4a3-4080-93b9-5526b7102894/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru3.ko-entry_point.cil.out.i[192198,192211] [2022-11-02 20:43:27,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:43:27,868 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:43:28,228 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_64887294-b4a3-4080-93b9-5526b7102894/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru3.ko-entry_point.cil.out.i[192198,192211] [2022-11-02 20:43:28,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:43:28,499 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:43:28,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:28 WrapperNode [2022-11-02 20:43:28,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:43:28,504 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:43:28,504 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:43:28,505 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:43:28,513 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:43:28" (1/1) ... [2022-11-02 20:43:28,614 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:43:28" (1/1) ... [2022-11-02 20:43:28,930 INFO L138 Inliner]: procedures = 165, calls = 5249, calls flagged for inlining = 57, calls inlined = 52, statements flattened = 6390 [2022-11-02 20:43:28,932 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:43:28,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:43:28,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:43:28,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:43:28,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:28" (1/1) ... [2022-11-02 20:43:28,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:28" (1/1) ... [2022-11-02 20:43:29,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:28" (1/1) ... [2022-11-02 20:43:29,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:28" (1/1) ... [2022-11-02 20:43:29,245 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:28" (1/1) ... [2022-11-02 20:43:29,267 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:28" (1/1) ... [2022-11-02 20:43:29,299 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:28" (1/1) ... [2022-11-02 20:43:29,319 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:28" (1/1) ... [2022-11-02 20:43:29,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:43:29,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:43:29,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:43:29,358 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:43:29,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:28" (1/1) ... [2022-11-02 20:43:29,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:43:29,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64887294-b4a3-4080-93b9-5526b7102894/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:29,401 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64887294-b4a3-4080-93b9-5526b7102894/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:29,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64887294-b4a3-4080-93b9-5526b7102894/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:43:29,453 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_wait_while_busy [2022-11-02 20:43:29,453 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_wait_while_busy [2022-11-02 20:43:29,453 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-11-02 20:43:29,453 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-11-02 20:43:29,454 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_wait_for_read [2022-11-02 20:43:29,454 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_wait_for_read [2022-11-02 20:43:29,454 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-11-02 20:43:29,454 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-11-02 20:43:29,454 INFO L130 BoogieDeclarations]: Found specification of procedure platform_driver_unregister [2022-11-02 20:43:29,455 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_driver_unregister [2022-11-02 20:43:29,455 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_remove [2022-11-02 20:43:29,455 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_remove [2022-11-02 20:43:29,455 INFO L130 BoogieDeclarations]: Found specification of procedure dmi_get_system_info [2022-11-02 20:43:29,455 INFO L138 BoogieDeclarations]: Found implementation of procedure dmi_get_system_info [2022-11-02 20:43:29,456 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-02 20:43:29,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-02 20:43:29,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:43:29,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-02 20:43:29,456 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-02 20:43:29,457 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_read [2022-11-02 20:43:29,457 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_read [2022-11-02 20:43:29,457 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-02 20:43:29,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-02 20:43:29,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:43:29,458 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-11-02 20:43:29,458 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-11-02 20:43:29,458 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-02 20:43:29,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-02 20:43:29,458 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_probe [2022-11-02 20:43:29,459 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_probe [2022-11-02 20:43:29,459 INFO L130 BoogieDeclarations]: Found specification of procedure device_create_file [2022-11-02 20:43:29,459 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create_file [2022-11-02 20:43:29,459 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_update_lock_of_abituguru3_data [2022-11-02 20:43:29,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_update_lock_of_abituguru3_data [2022-11-02 20:43:29,460 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-02 20:43:29,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-02 20:43:29,460 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_suspend [2022-11-02 20:43:29,460 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_suspend [2022-11-02 20:43:29,461 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-11-02 20:43:29,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-11-02 20:43:29,461 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-02 20:43:29,461 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-02 20:43:29,462 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_read_increment_offset [2022-11-02 20:43:29,462 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_read_increment_offset [2022-11-02 20:43:29,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:43:29,462 INFO L130 BoogieDeclarations]: Found specification of procedure inb_p [2022-11-02 20:43:29,462 INFO L138 BoogieDeclarations]: Found implementation of procedure inb_p [2022-11-02 20:43:29,463 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-11-02 20:43:29,463 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-11-02 20:43:29,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:43:29,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:43:29,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:43:29,464 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_update_device [2022-11-02 20:43:29,464 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_update_device [2022-11-02 20:43:29,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:43:29,465 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-11-02 20:43:29,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-11-02 20:43:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:43:29,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:43:29,468 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_update_lock_of_abituguru3_data [2022-11-02 20:43:29,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_update_lock_of_abituguru3_data [2022-11-02 20:43:29,468 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2022-11-02 20:43:29,468 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2022-11-02 20:43:29,468 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2022-11-02 20:43:29,469 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2022-11-02 20:43:29,469 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2022-11-02 20:43:29,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:43:29,469 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2022-11-02 20:43:29,470 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2022-11-02 20:43:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:43:29,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:43:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_resume [2022-11-02 20:43:29,471 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_resume [2022-11-02 20:43:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-11-02 20:43:29,471 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-11-02 20:43:29,896 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:43:29,898 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:43:32,869 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-02 20:43:42,802 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:43:42,814 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:43:42,814 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:43:42,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:43:42 BoogieIcfgContainer [2022-11-02 20:43:42,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:43:42,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:43:42,820 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:43:42,823 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:43:42,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:43:26" (1/3) ... [2022-11-02 20:43:42,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c481c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:43:42, skipping insertion in model container [2022-11-02 20:43:42,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:28" (2/3) ... [2022-11-02 20:43:42,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c481c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:43:42, skipping insertion in model container [2022-11-02 20:43:42,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:43:42" (3/3) ... [2022-11-02 20:43:42,827 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru3.ko-entry_point.cil.out.i [2022-11-02 20:43:42,847 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:43:42,847 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:43:42,910 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:43:42,916 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;@398f6452, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:43:42,917 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:43:42,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 559 states, 426 states have (on average 1.4366197183098592) internal successors, (612), 439 states have internal predecessors, (612), 101 states have call successors, (101), 31 states have call predecessors, (101), 30 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) [2022-11-02 20:43:42,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:43:42,934 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:42,935 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] [2022-11-02 20:43:42,935 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:42,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:42,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1970887230, now seen corresponding path program 1 times [2022-11-02 20:43:42,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:42,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435805212] [2022-11-02 20:43:42,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:42,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:44,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:43:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:44,483 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:44,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:44,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435805212] [2022-11-02 20:43:44,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435805212] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:44,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:44,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:43:44,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140766283] [2022-11-02 20:43:44,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:44,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:44,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:44,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:44,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:44,538 INFO L87 Difference]: Start difference. First operand has 559 states, 426 states have (on average 1.4366197183098592) internal successors, (612), 439 states have internal predecessors, (612), 101 states have call successors, (101), 31 states have call predecessors, (101), 30 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:43:45,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:45,145 INFO L93 Difference]: Finished difference Result 1560 states and 2283 transitions. [2022-11-02 20:43:45,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:45,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-11-02 20:43:45,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:45,177 INFO L225 Difference]: With dead ends: 1560 [2022-11-02 20:43:45,177 INFO L226 Difference]: Without dead ends: 987 [2022-11-02 20:43:45,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:45,196 INFO L413 NwaCegarLoop]: 904 mSDtfsCounter, 616 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:45,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 1640 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:43:45,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2022-11-02 20:43:45,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 973. [2022-11-02 20:43:45,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 740 states have (on average 1.4) internal successors, (1036), 751 states have internal predecessors, (1036), 176 states have call successors, (176), 57 states have call predecessors, (176), 56 states have return successors, (171), 170 states have call predecessors, (171), 171 states have call successors, (171) [2022-11-02 20:43:45,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1383 transitions. [2022-11-02 20:43:45,331 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1383 transitions. Word has length 23 [2022-11-02 20:43:45,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:45,331 INFO L495 AbstractCegarLoop]: Abstraction has 973 states and 1383 transitions. [2022-11-02 20:43:45,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:43:45,332 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1383 transitions. [2022-11-02 20:43:45,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:43:45,334 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:45,334 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] [2022-11-02 20:43:45,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:43:45,335 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:45,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:45,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1089981821, now seen corresponding path program 1 times [2022-11-02 20:43:45,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:45,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98118945] [2022-11-02 20:43:45,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:45,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:46,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:43:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:46,629 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:46,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:46,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98118945] [2022-11-02 20:43:46,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98118945] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:46,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:46,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:43:46,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414428479] [2022-11-02 20:43:46,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:46,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:46,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:46,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:46,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:46,634 INFO L87 Difference]: Start difference. First operand 973 states and 1383 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:43:47,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:47,090 INFO L93 Difference]: Finished difference Result 2750 states and 3913 transitions. [2022-11-02 20:43:47,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:47,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-11-02 20:43:47,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:47,101 INFO L225 Difference]: With dead ends: 2750 [2022-11-02 20:43:47,101 INFO L226 Difference]: Without dead ends: 1780 [2022-11-02 20:43:47,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:47,106 INFO L413 NwaCegarLoop]: 1342 mSDtfsCounter, 757 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 2023 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:47,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 2023 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:43:47,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2022-11-02 20:43:47,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1771. [2022-11-02 20:43:47,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1340 states have (on average 1.4014925373134328) internal successors, (1878), 1356 states have internal predecessors, (1878), 323 states have call successors, (323), 108 states have call predecessors, (323), 107 states have return successors, (318), 318 states have call predecessors, (318), 318 states have call successors, (318) [2022-11-02 20:43:47,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2519 transitions. [2022-11-02 20:43:47,202 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2519 transitions. Word has length 21 [2022-11-02 20:43:47,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:47,202 INFO L495 AbstractCegarLoop]: Abstraction has 1771 states and 2519 transitions. [2022-11-02 20:43:47,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:43:47,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2519 transitions. [2022-11-02 20:43:47,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:43:47,211 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:47,211 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] [2022-11-02 20:43:47,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:43:47,213 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:47,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:47,223 INFO L85 PathProgramCache]: Analyzing trace with hash 2140487856, now seen corresponding path program 1 times [2022-11-02 20:43:47,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:47,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151360575] [2022-11-02 20:43:47,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:47,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:49,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:43:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:49,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:49,121 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:49,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:49,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151360575] [2022-11-02 20:43:49,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151360575] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:49,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:49,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:43:49,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086663564] [2022-11-02 20:43:49,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:49,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:43:49,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:49,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:43:49,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:43:49,124 INFO L87 Difference]: Start difference. First operand 1771 states and 2519 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:43:52,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:52,168 INFO L93 Difference]: Finished difference Result 4844 states and 7178 transitions. [2022-11-02 20:43:52,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:43:52,175 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-11-02 20:43:52,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:52,196 INFO L225 Difference]: With dead ends: 4844 [2022-11-02 20:43:52,196 INFO L226 Difference]: Without dead ends: 3076 [2022-11-02 20:43:52,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:43:52,220 INFO L413 NwaCegarLoop]: 1337 mSDtfsCounter, 915 mSDsluCounter, 4985 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 6322 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:52,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 6322 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-02 20:43:52,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3076 states. [2022-11-02 20:43:52,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3076 to 1793. [2022-11-02 20:43:52,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1793 states, 1358 states have (on average 1.4005891016200294) internal successors, (1902), 1374 states have internal predecessors, (1902), 327 states have call successors, (327), 108 states have call predecessors, (327), 107 states have return successors, (322), 322 states have call predecessors, (322), 322 states have call successors, (322) [2022-11-02 20:43:52,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2551 transitions. [2022-11-02 20:43:52,351 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2551 transitions. Word has length 32 [2022-11-02 20:43:52,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:52,353 INFO L495 AbstractCegarLoop]: Abstraction has 1793 states and 2551 transitions. [2022-11-02 20:43:52,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:43:52,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2551 transitions. [2022-11-02 20:43:52,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:43:52,359 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:52,359 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] [2022-11-02 20:43:52,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:43:52,364 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:52,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:52,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1935624722, now seen corresponding path program 1 times [2022-11-02 20:43:52,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:52,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240122272] [2022-11-02 20:43:52,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:52,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:53,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:43:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:53,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:53,247 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:53,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:53,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240122272] [2022-11-02 20:43:53,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240122272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:53,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:53,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:43:53,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071392034] [2022-11-02 20:43:53,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:53,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:43:53,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:53,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:43:53,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:43:53,255 INFO L87 Difference]: Start difference. First operand 1793 states and 2551 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:43:54,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:54,283 INFO L93 Difference]: Finished difference Result 1877 states and 2700 transitions. [2022-11-02 20:43:54,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:43:54,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-11-02 20:43:54,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:54,301 INFO L225 Difference]: With dead ends: 1877 [2022-11-02 20:43:54,301 INFO L226 Difference]: Without dead ends: 1874 [2022-11-02 20:43:54,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:43:54,304 INFO L413 NwaCegarLoop]: 763 mSDtfsCounter, 805 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:54,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 1240 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:43:54,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2022-11-02 20:43:54,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1792. [2022-11-02 20:43:54,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1358 states have (on average 1.3998527245949925) internal successors, (1901), 1373 states have internal predecessors, (1901), 326 states have call successors, (326), 108 states have call predecessors, (326), 107 states have return successors, (322), 322 states have call predecessors, (322), 322 states have call successors, (322) [2022-11-02 20:43:54,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2549 transitions. [2022-11-02 20:43:54,463 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2549 transitions. Word has length 32 [2022-11-02 20:43:54,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:54,464 INFO L495 AbstractCegarLoop]: Abstraction has 1792 states and 2549 transitions. [2022-11-02 20:43:54,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:43:54,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2549 transitions. [2022-11-02 20:43:54,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:43:54,466 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:54,467 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] [2022-11-02 20:43:54,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:43:54,467 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:54,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:54,468 INFO L85 PathProgramCache]: Analyzing trace with hash 125104557, now seen corresponding path program 1 times [2022-11-02 20:43:54,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:54,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318050823] [2022-11-02 20:43:54,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:54,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:55,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:43:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:55,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:55,304 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:55,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:55,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318050823] [2022-11-02 20:43:55,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318050823] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:55,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:55,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:43:55,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970054372] [2022-11-02 20:43:55,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:55,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:43:55,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:55,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:43:55,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:43:55,307 INFO L87 Difference]: Start difference. First operand 1792 states and 2549 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:43:56,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:56,351 INFO L93 Difference]: Finished difference Result 1876 states and 2698 transitions. [2022-11-02 20:43:56,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:43:56,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2022-11-02 20:43:56,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:56,368 INFO L225 Difference]: With dead ends: 1876 [2022-11-02 20:43:56,368 INFO L226 Difference]: Without dead ends: 1873 [2022-11-02 20:43:56,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:43:56,371 INFO L413 NwaCegarLoop]: 761 mSDtfsCounter, 802 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:56,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 1237 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:43:56,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2022-11-02 20:43:56,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1791. [2022-11-02 20:43:56,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1791 states, 1358 states have (on average 1.3991163475699557) internal successors, (1900), 1372 states have internal predecessors, (1900), 325 states have call successors, (325), 108 states have call predecessors, (325), 107 states have return successors, (322), 322 states have call predecessors, (322), 322 states have call successors, (322) [2022-11-02 20:43:56,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2547 transitions. [2022-11-02 20:43:56,533 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2547 transitions. Word has length 33 [2022-11-02 20:43:56,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:56,534 INFO L495 AbstractCegarLoop]: Abstraction has 1791 states and 2547 transitions. [2022-11-02 20:43:56,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:43:56,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2547 transitions. [2022-11-02 20:43:56,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:43:56,535 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:56,536 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] [2022-11-02 20:43:56,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:43:56,536 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:56,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:56,538 INFO L85 PathProgramCache]: Analyzing trace with hash -416792367, now seen corresponding path program 1 times [2022-11-02 20:43:56,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:56,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482993055] [2022-11-02 20:43:56,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:56,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:57,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:43:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:57,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:57,540 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:57,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:57,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482993055] [2022-11-02 20:43:57,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482993055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:57,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:57,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:43:57,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254965100] [2022-11-02 20:43:57,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:57,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:43:57,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:57,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:43:57,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:43:57,543 INFO L87 Difference]: Start difference. First operand 1791 states and 2547 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:43:59,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:59,175 INFO L93 Difference]: Finished difference Result 5089 states and 7303 transitions. [2022-11-02 20:43:59,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:43:59,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2022-11-02 20:43:59,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:59,196 INFO L225 Difference]: With dead ends: 5089 [2022-11-02 20:43:59,196 INFO L226 Difference]: Without dead ends: 3289 [2022-11-02 20:43:59,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:43:59,205 INFO L413 NwaCegarLoop]: 823 mSDtfsCounter, 803 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 1846 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:59,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 1846 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-02 20:43:59,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3289 states. [2022-11-02 20:43:59,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3289 to 3186. [2022-11-02 20:43:59,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3186 states, 2415 states have (on average 1.3958592132505176) internal successors, (3371), 2452 states have internal predecessors, (3371), 589 states have call successors, (589), 195 states have call predecessors, (589), 181 states have return successors, (583), 562 states have call predecessors, (583), 579 states have call successors, (583) [2022-11-02 20:43:59,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3186 states to 3186 states and 4543 transitions. [2022-11-02 20:43:59,395 INFO L78 Accepts]: Start accepts. Automaton has 3186 states and 4543 transitions. Word has length 34 [2022-11-02 20:43:59,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:59,397 INFO L495 AbstractCegarLoop]: Abstraction has 3186 states and 4543 transitions. [2022-11-02 20:43:59,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:43:59,397 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 4543 transitions. [2022-11-02 20:43:59,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 20:43:59,399 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:59,400 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:59,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:43:59,401 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:43:59,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:59,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1540623621, now seen corresponding path program 1 times [2022-11-02 20:43:59,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:59,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084032022] [2022-11-02 20:43:59,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:59,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:00,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:44:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:00,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:00,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:44:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:00,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:00,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:44:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:00,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 20:44:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:00,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:44:00,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:00,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084032022] [2022-11-02 20:44:00,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084032022] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:00,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:00,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:44:00,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78429538] [2022-11-02 20:44:00,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:00,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:44:00,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:00,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:44:00,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:44:00,438 INFO L87 Difference]: Start difference. First operand 3186 states and 4543 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 20:44:04,268 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:06,477 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:08,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:08,513 INFO L93 Difference]: Finished difference Result 8718 states and 12635 transitions. [2022-11-02 20:44:08,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:44:08,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 66 [2022-11-02 20:44:08,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:08,560 INFO L225 Difference]: With dead ends: 8718 [2022-11-02 20:44:08,560 INFO L226 Difference]: Without dead ends: 5535 [2022-11-02 20:44:08,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:44:08,578 INFO L413 NwaCegarLoop]: 991 mSDtfsCounter, 1103 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 568 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 2619 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 568 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:08,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 2619 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [568 Valid, 915 Invalid, 2 Unknown, 0 Unchecked, 7.7s Time] [2022-11-02 20:44:08,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5535 states. [2022-11-02 20:44:08,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5535 to 4738. [2022-11-02 20:44:08,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4738 states, 3613 states have (on average 1.3874896208137282) internal successors, (5013), 3662 states have internal predecessors, (5013), 857 states have call successors, (857), 285 states have call predecessors, (857), 267 states have return successors, (853), 826 states have call predecessors, (853), 847 states have call successors, (853) [2022-11-02 20:44:08,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4738 states to 4738 states and 6723 transitions. [2022-11-02 20:44:08,928 INFO L78 Accepts]: Start accepts. Automaton has 4738 states and 6723 transitions. Word has length 66 [2022-11-02 20:44:08,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:08,930 INFO L495 AbstractCegarLoop]: Abstraction has 4738 states and 6723 transitions. [2022-11-02 20:44:08,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 20:44:08,930 INFO L276 IsEmpty]: Start isEmpty. Operand 4738 states and 6723 transitions. [2022-11-02 20:44:08,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-02 20:44:08,934 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:08,934 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:08,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:44:08,935 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:08,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:08,935 INFO L85 PathProgramCache]: Analyzing trace with hash 127935254, now seen corresponding path program 1 times [2022-11-02 20:44:08,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:08,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901677557] [2022-11-02 20:44:08,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:08,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:44:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:44:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:44:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:44:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 20:44:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 20:44:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-02 20:44:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:44:09,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:09,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901677557] [2022-11-02 20:44:09,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901677557] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:09,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:09,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:44:09,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829210553] [2022-11-02 20:44:09,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:09,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:44:09,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:09,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:44:09,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:44:09,803 INFO L87 Difference]: Start difference. First operand 4738 states and 6723 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 20:44:13,645 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:15,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:15,142 INFO L93 Difference]: Finished difference Result 11124 states and 15869 transitions. [2022-11-02 20:44:15,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:44:15,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 85 [2022-11-02 20:44:15,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:15,183 INFO L225 Difference]: With dead ends: 11124 [2022-11-02 20:44:15,183 INFO L226 Difference]: Without dead ends: 6389 [2022-11-02 20:44:15,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:44:15,202 INFO L413 NwaCegarLoop]: 727 mSDtfsCounter, 756 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 370 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 2140 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:15,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 2140 Invalid, 1473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 1102 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2022-11-02 20:44:15,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6389 states. [2022-11-02 20:44:15,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6389 to 6142. [2022-11-02 20:44:15,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6142 states, 4803 states have (on average 1.402665001041016) internal successors, (6737), 4868 states have internal predecessors, (6737), 995 states have call successors, (995), 361 states have call predecessors, (995), 343 states have return successors, (991), 948 states have call predecessors, (991), 979 states have call successors, (991) [2022-11-02 20:44:15,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6142 states to 6142 states and 8723 transitions. [2022-11-02 20:44:15,567 INFO L78 Accepts]: Start accepts. Automaton has 6142 states and 8723 transitions. Word has length 85 [2022-11-02 20:44:15,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:15,567 INFO L495 AbstractCegarLoop]: Abstraction has 6142 states and 8723 transitions. [2022-11-02 20:44:15,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 20:44:15,567 INFO L276 IsEmpty]: Start isEmpty. Operand 6142 states and 8723 transitions. [2022-11-02 20:44:15,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-02 20:44:15,570 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:15,570 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-11-02 20:44:15,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:44:15,570 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:15,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:15,571 INFO L85 PathProgramCache]: Analyzing trace with hash 986755271, now seen corresponding path program 1 times [2022-11-02 20:44:15,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:15,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32595831] [2022-11-02 20:44:15,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:15,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:16,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:44:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:16,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:16,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:44:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:16,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:16,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:44:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:16,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-02 20:44:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:16,747 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:44:16,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:16,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32595831] [2022-11-02 20:44:16,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32595831] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:16,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:16,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:44:16,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648403171] [2022-11-02 20:44:16,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:16,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:44:16,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:16,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:44:16,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:44:16,751 INFO L87 Difference]: Start difference. First operand 6142 states and 8723 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 20:44:21,285 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:24,217 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:27,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:27,414 INFO L93 Difference]: Finished difference Result 15372 states and 22173 transitions. [2022-11-02 20:44:27,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:44:27,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 86 [2022-11-02 20:44:27,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:27,462 INFO L225 Difference]: With dead ends: 15372 [2022-11-02 20:44:27,463 INFO L226 Difference]: Without dead ends: 9233 [2022-11-02 20:44:27,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:44:27,487 INFO L413 NwaCegarLoop]: 1371 mSDtfsCounter, 820 mSDsluCounter, 2892 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 298 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 4263 SdHoareTripleChecker+Invalid, 1667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:27,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 4263 Invalid, 1667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 1367 Invalid, 2 Unknown, 0 Unchecked, 10.1s Time] [2022-11-02 20:44:27,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9233 states. [2022-11-02 20:44:28,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9233 to 8128. [2022-11-02 20:44:28,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8128 states, 6388 states have (on average 1.3963681903569192) internal successors, (8920), 6464 states have internal predecessors, (8920), 1289 states have call successors, (1289), 469 states have call predecessors, (1289), 450 states have return successors, (1292), 1242 states have call predecessors, (1292), 1276 states have call successors, (1292) [2022-11-02 20:44:28,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8128 states to 8128 states and 11501 transitions. [2022-11-02 20:44:28,126 INFO L78 Accepts]: Start accepts. Automaton has 8128 states and 11501 transitions. Word has length 86 [2022-11-02 20:44:28,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:28,127 INFO L495 AbstractCegarLoop]: Abstraction has 8128 states and 11501 transitions. [2022-11-02 20:44:28,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 20:44:28,145 INFO L276 IsEmpty]: Start isEmpty. Operand 8128 states and 11501 transitions. [2022-11-02 20:44:28,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-02 20:44:28,153 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:28,154 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:28,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:44:28,154 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:28,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:28,155 INFO L85 PathProgramCache]: Analyzing trace with hash -216719008, now seen corresponding path program 1 times [2022-11-02 20:44:28,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:28,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545623476] [2022-11-02 20:44:28,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:28,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:29,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:44:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:29,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:29,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:44:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:29,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:29,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:44:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:29,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-02 20:44:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:29,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:29,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:44:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:29,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:44:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:29,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-02 20:44:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:29,272 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:44:29,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:29,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545623476] [2022-11-02 20:44:29,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545623476] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:29,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:29,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:44:29,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294613470] [2022-11-02 20:44:29,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:29,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:44:29,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:29,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:44:29,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:44:29,278 INFO L87 Difference]: Start difference. First operand 8128 states and 11501 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:44:34,378 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:36,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:44:38,918 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:42,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:42,954 INFO L93 Difference]: Finished difference Result 19602 states and 28161 transitions. [2022-11-02 20:44:42,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:44:42,955 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 117 [2022-11-02 20:44:42,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:43,010 INFO L225 Difference]: With dead ends: 19602 [2022-11-02 20:44:43,011 INFO L226 Difference]: Without dead ends: 11477 [2022-11-02 20:44:43,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:44:43,041 INFO L413 NwaCegarLoop]: 1266 mSDtfsCounter, 1075 mSDsluCounter, 2630 mSDsCounter, 0 mSdLazyCounter, 2331 mSolverCounterSat, 645 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 3896 SdHoareTripleChecker+Invalid, 2979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 645 IncrementalHoareTripleChecker+Valid, 2331 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:43,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 3896 Invalid, 2979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [645 Valid, 2331 Invalid, 3 Unknown, 0 Unchecked, 12.9s Time] [2022-11-02 20:44:43,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11477 states. [2022-11-02 20:44:43,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11477 to 10110. [2022-11-02 20:44:43,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10110 states, 7968 states have (on average 1.3928212851405624) internal successors, (11098), 8058 states have internal predecessors, (11098), 1587 states have call successors, (1587), 575 states have call predecessors, (1587), 554 states have return successors, (1594), 1536 states have call predecessors, (1594), 1574 states have call successors, (1594) [2022-11-02 20:44:43,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10110 states to 10110 states and 14279 transitions. [2022-11-02 20:44:43,723 INFO L78 Accepts]: Start accepts. Automaton has 10110 states and 14279 transitions. Word has length 117 [2022-11-02 20:44:43,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:43,724 INFO L495 AbstractCegarLoop]: Abstraction has 10110 states and 14279 transitions. [2022-11-02 20:44:43,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:44:43,724 INFO L276 IsEmpty]: Start isEmpty. Operand 10110 states and 14279 transitions. [2022-11-02 20:44:43,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-02 20:44:43,729 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:43,730 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:43,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:44:43,730 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:43,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:43,731 INFO L85 PathProgramCache]: Analyzing trace with hash 504148532, now seen corresponding path program 1 times [2022-11-02 20:44:43,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:43,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250075398] [2022-11-02 20:44:43,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:43,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:44,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:44:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:44,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:44,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:44:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:44,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:44,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:44:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:44,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-02 20:44:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:44,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:44,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:44:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:44,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:44:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:44,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 20:44:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:44,625 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-02 20:44:44,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:44,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250075398] [2022-11-02 20:44:44,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250075398] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:44,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:44,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:44:44,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827904169] [2022-11-02 20:44:44,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:44,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:44:44,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:44,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:44:44,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:44:44,628 INFO L87 Difference]: Start difference. First operand 10110 states and 14279 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:44:49,075 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,619 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:55,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:55,446 INFO L93 Difference]: Finished difference Result 23836 states and 34157 transitions. [2022-11-02 20:44:55,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:44:55,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 119 [2022-11-02 20:44:55,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:55,517 INFO L225 Difference]: With dead ends: 23836 [2022-11-02 20:44:55,517 INFO L226 Difference]: Without dead ends: 13729 [2022-11-02 20:44:55,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:44:55,551 INFO L413 NwaCegarLoop]: 1293 mSDtfsCounter, 1168 mSDsluCounter, 2113 mSDsCounter, 0 mSdLazyCounter, 2003 mSolverCounterSat, 785 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 3406 SdHoareTripleChecker+Invalid, 2790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 785 IncrementalHoareTripleChecker+Valid, 2003 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:55,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1236 Valid, 3406 Invalid, 2790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [785 Valid, 2003 Invalid, 2 Unknown, 0 Unchecked, 10.0s Time] [2022-11-02 20:44:55,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13729 states. [2022-11-02 20:44:56,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13729 to 12092. [2022-11-02 20:44:56,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12092 states, 9548 states have (on average 1.3904482614160034) internal successors, (13276), 9652 states have internal predecessors, (13276), 1885 states have call successors, (1885), 681 states have call predecessors, (1885), 658 states have return successors, (1896), 1830 states have call predecessors, (1896), 1872 states have call successors, (1896) [2022-11-02 20:44:56,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12092 states to 12092 states and 17057 transitions. [2022-11-02 20:44:56,372 INFO L78 Accepts]: Start accepts. Automaton has 12092 states and 17057 transitions. Word has length 119 [2022-11-02 20:44:56,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:56,373 INFO L495 AbstractCegarLoop]: Abstraction has 12092 states and 17057 transitions. [2022-11-02 20:44:56,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:44:56,374 INFO L276 IsEmpty]: Start isEmpty. Operand 12092 states and 17057 transitions. [2022-11-02 20:44:56,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-02 20:44:56,379 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:56,379 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2022-11-02 20:44:56,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:44:56,380 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:44:56,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:56,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1210000877, now seen corresponding path program 1 times [2022-11-02 20:44:56,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:56,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581003945] [2022-11-02 20:44:56,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:56,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:57,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:44:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:57,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:57,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:44:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:57,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:57,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:44:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:57,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:44:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:57,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:57,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:44:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:57,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:44:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:57,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 20:44:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:57,278 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-02 20:44:57,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:57,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581003945] [2022-11-02 20:44:57,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581003945] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:57,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:57,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:44:57,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917434645] [2022-11-02 20:44:57,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:57,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:44:57,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:57,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:44:57,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:44:57,280 INFO L87 Difference]: Start difference. First operand 12092 states and 17057 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:45:01,758 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:03,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:45:06,429 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:11,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:11,229 INFO L93 Difference]: Finished difference Result 28070 states and 40153 transitions. [2022-11-02 20:45:11,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:45:11,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 119 [2022-11-02 20:45:11,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:11,296 INFO L225 Difference]: With dead ends: 28070 [2022-11-02 20:45:11,297 INFO L226 Difference]: Without dead ends: 15981 [2022-11-02 20:45:11,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:45:11,329 INFO L413 NwaCegarLoop]: 1279 mSDtfsCounter, 1072 mSDsluCounter, 2677 mSDsCounter, 0 mSdLazyCounter, 2324 mSolverCounterSat, 644 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 3956 SdHoareTripleChecker+Invalid, 2971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 644 IncrementalHoareTripleChecker+Valid, 2324 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:11,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 3956 Invalid, 2971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [644 Valid, 2324 Invalid, 3 Unknown, 0 Unchecked, 13.0s Time] [2022-11-02 20:45:11,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15981 states. [2022-11-02 20:45:12,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15981 to 14074. [2022-11-02 20:45:12,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14074 states, 11128 states have (on average 1.3887491013659239) internal successors, (15454), 11246 states have internal predecessors, (15454), 2183 states have call successors, (2183), 787 states have call predecessors, (2183), 762 states have return successors, (2198), 2124 states have call predecessors, (2198), 2170 states have call successors, (2198) [2022-11-02 20:45:12,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14074 states to 14074 states and 19835 transitions. [2022-11-02 20:45:12,273 INFO L78 Accepts]: Start accepts. Automaton has 14074 states and 19835 transitions. Word has length 119 [2022-11-02 20:45:12,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:12,273 INFO L495 AbstractCegarLoop]: Abstraction has 14074 states and 19835 transitions. [2022-11-02 20:45:12,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:45:12,274 INFO L276 IsEmpty]: Start isEmpty. Operand 14074 states and 19835 transitions. [2022-11-02 20:45:12,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-02 20:45:12,288 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:12,288 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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] [2022-11-02 20:45:12,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:45:12,289 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:45:12,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:12,291 INFO L85 PathProgramCache]: Analyzing trace with hash 278316373, now seen corresponding path program 1 times [2022-11-02 20:45:12,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:12,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586863020] [2022-11-02 20:45:12,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:12,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:13,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:45:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:13,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:13,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:45:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:13,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:13,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:13,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:13,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-02 20:45:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:13,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:13,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:13,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:13,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:45:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:13,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-02 20:45:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:13,583 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:45:13,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:13,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586863020] [2022-11-02 20:45:13,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586863020] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:13,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:13,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:45:13,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484380489] [2022-11-02 20:45:13,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:13,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:45:13,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:13,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:45:13,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:45:13,586 INFO L87 Difference]: Start difference. First operand 14074 states and 19835 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:45:17,923 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:19,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:45:23,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:23,390 INFO L93 Difference]: Finished difference Result 30035 states and 42747 transitions. [2022-11-02 20:45:23,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:45:23,391 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 120 [2022-11-02 20:45:23,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:23,459 INFO L225 Difference]: With dead ends: 30035 [2022-11-02 20:45:23,460 INFO L226 Difference]: Without dead ends: 15964 [2022-11-02 20:45:23,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:45:23,501 INFO L413 NwaCegarLoop]: 718 mSDtfsCounter, 1148 mSDsluCounter, 2172 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 546 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 2890 SdHoareTripleChecker+Invalid, 2346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 546 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:23,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 2890 Invalid, 2346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [546 Valid, 1798 Invalid, 2 Unknown, 0 Unchecked, 8.9s Time] [2022-11-02 20:45:23,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15964 states. [2022-11-02 20:45:24,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15964 to 14074. [2022-11-02 20:45:24,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14074 states, 11128 states have (on average 1.388389647735442) internal successors, (15450), 11246 states have internal predecessors, (15450), 2183 states have call successors, (2183), 787 states have call predecessors, (2183), 762 states have return successors, (2198), 2124 states have call predecessors, (2198), 2170 states have call successors, (2198) [2022-11-02 20:45:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14074 states to 14074 states and 19831 transitions. [2022-11-02 20:45:24,488 INFO L78 Accepts]: Start accepts. Automaton has 14074 states and 19831 transitions. Word has length 120 [2022-11-02 20:45:24,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:24,489 INFO L495 AbstractCegarLoop]: Abstraction has 14074 states and 19831 transitions. [2022-11-02 20:45:24,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:45:24,489 INFO L276 IsEmpty]: Start isEmpty. Operand 14074 states and 19831 transitions. [2022-11-02 20:45:24,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-11-02 20:45:24,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:24,495 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 20:45:24,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:45:24,496 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:45:24,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:24,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1220157427, now seen corresponding path program 1 times [2022-11-02 20:45:24,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:24,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290623974] [2022-11-02 20:45:24,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:24,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:25,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:45:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:25,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:25,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:45:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:25,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:25,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:25,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:45:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:25,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:25,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:25,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:45:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:25,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 20:45:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:25,832 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-02 20:45:25,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:25,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290623974] [2022-11-02 20:45:25,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290623974] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:25,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:25,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:45:25,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090639566] [2022-11-02 20:45:25,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:25,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:45:25,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:25,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:45:25,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:45:25,835 INFO L87 Difference]: Start difference. First operand 14074 states and 19831 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:45:30,323 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:33,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:33,184 INFO L93 Difference]: Finished difference Result 30035 states and 42739 transitions. [2022-11-02 20:45:33,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:45:33,185 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 123 [2022-11-02 20:45:33,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:33,238 INFO L225 Difference]: With dead ends: 30035 [2022-11-02 20:45:33,239 INFO L226 Difference]: Without dead ends: 15964 [2022-11-02 20:45:33,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:45:33,278 INFO L413 NwaCegarLoop]: 700 mSDtfsCounter, 1387 mSDsluCounter, 1837 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 815 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1423 SdHoareTripleChecker+Valid, 2537 SdHoareTripleChecker+Invalid, 2274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 815 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:33,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1423 Valid, 2537 Invalid, 2274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [815 Valid, 1458 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2022-11-02 20:45:33,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15964 states. [2022-11-02 20:45:34,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15964 to 14074. [2022-11-02 20:45:34,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14074 states, 11128 states have (on average 1.3880301941049604) internal successors, (15446), 11246 states have internal predecessors, (15446), 2183 states have call successors, (2183), 787 states have call predecessors, (2183), 762 states have return successors, (2198), 2124 states have call predecessors, (2198), 2170 states have call successors, (2198) [2022-11-02 20:45:34,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14074 states to 14074 states and 19827 transitions. [2022-11-02 20:45:34,236 INFO L78 Accepts]: Start accepts. Automaton has 14074 states and 19827 transitions. Word has length 123 [2022-11-02 20:45:34,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:34,236 INFO L495 AbstractCegarLoop]: Abstraction has 14074 states and 19827 transitions. [2022-11-02 20:45:34,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:45:34,237 INFO L276 IsEmpty]: Start isEmpty. Operand 14074 states and 19827 transitions. [2022-11-02 20:45:34,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-02 20:45:34,243 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:34,243 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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] [2022-11-02 20:45:34,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:45:34,244 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:45:34,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:34,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1039882275, now seen corresponding path program 1 times [2022-11-02 20:45:34,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:34,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081997930] [2022-11-02 20:45:34,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:34,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:35,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:45:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:35,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:35,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:45:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:35,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:35,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:35,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-02 20:45:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:35,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:35,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:35,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:45:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:35,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-02 20:45:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:35,488 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-02 20:45:35,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:35,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081997930] [2022-11-02 20:45:35,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081997930] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:35,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:35,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:45:35,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020262213] [2022-11-02 20:45:35,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:35,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:45:35,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:35,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:45:35,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:45:35,491 INFO L87 Difference]: Start difference. First operand 14074 states and 19827 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:45:39,361 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:42,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:42,468 INFO L93 Difference]: Finished difference Result 30035 states and 42731 transitions. [2022-11-02 20:45:42,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:45:42,469 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 120 [2022-11-02 20:45:42,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:42,503 INFO L225 Difference]: With dead ends: 30035 [2022-11-02 20:45:42,503 INFO L226 Difference]: Without dead ends: 15964 [2022-11-02 20:45:42,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:45:42,522 INFO L413 NwaCegarLoop]: 710 mSDtfsCounter, 1368 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 814 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1404 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 2310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 814 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:42,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1404 Valid, 2542 Invalid, 2310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [814 Valid, 1495 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2022-11-02 20:45:42,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15964 states. [2022-11-02 20:45:43,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15964 to 14074. [2022-11-02 20:45:43,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14074 states, 11128 states have (on average 1.3876707404744788) internal successors, (15442), 11246 states have internal predecessors, (15442), 2183 states have call successors, (2183), 787 states have call predecessors, (2183), 762 states have return successors, (2198), 2124 states have call predecessors, (2198), 2170 states have call successors, (2198) [2022-11-02 20:45:43,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14074 states to 14074 states and 19823 transitions. [2022-11-02 20:45:43,484 INFO L78 Accepts]: Start accepts. Automaton has 14074 states and 19823 transitions. Word has length 120 [2022-11-02 20:45:43,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:43,484 INFO L495 AbstractCegarLoop]: Abstraction has 14074 states and 19823 transitions. [2022-11-02 20:45:43,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:45:43,485 INFO L276 IsEmpty]: Start isEmpty. Operand 14074 states and 19823 transitions. [2022-11-02 20:45:43,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-02 20:45:43,490 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:43,491 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2022-11-02 20:45:43,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:45:43,491 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:45:43,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:43,491 INFO L85 PathProgramCache]: Analyzing trace with hash 580686427, now seen corresponding path program 1 times [2022-11-02 20:45:43,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:43,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097811012] [2022-11-02 20:45:43,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:43,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:44,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:45:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:44,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:44,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:45:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:44,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:44,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:44,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:45:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:44,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:44,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:44,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:45:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:44,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-02 20:45:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:44,520 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:45:44,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:44,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097811012] [2022-11-02 20:45:44,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097811012] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:45:44,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856168507] [2022-11-02 20:45:44,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:44,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:44,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64887294-b4a3-4080-93b9-5526b7102894/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:44,534 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64887294-b4a3-4080-93b9-5526b7102894/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:44,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64887294-b4a3-4080-93b9-5526b7102894/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:45:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:46,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 12383 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:45:46,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:46,909 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:45:46,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:45:46,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856168507] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:46,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:45:46,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2022-11-02 20:45:46,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568684553] [2022-11-02 20:45:46,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:46,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:45:46,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:46,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:45:46,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:45:46,912 INFO L87 Difference]: Start difference. First operand 14074 states and 19823 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-02 20:45:48,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:48,779 INFO L93 Difference]: Finished difference Result 33201 states and 47327 transitions. [2022-11-02 20:45:48,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:45:48,780 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 120 [2022-11-02 20:45:48,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:48,819 INFO L225 Difference]: With dead ends: 33201 [2022-11-02 20:45:48,819 INFO L226 Difference]: Without dead ends: 19074 [2022-11-02 20:45:48,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:45:48,841 INFO L413 NwaCegarLoop]: 983 mSDtfsCounter, 297 mSDsluCounter, 5642 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 6625 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:48,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 6625 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:45:48,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19074 states. [2022-11-02 20:45:49,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19074 to 14078. [2022-11-02 20:45:49,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14078 states, 11132 states have (on average 1.3837585339561624) internal successors, (15404), 11250 states have internal predecessors, (15404), 2183 states have call successors, (2183), 787 states have call predecessors, (2183), 762 states have return successors, (2198), 2124 states have call predecessors, (2198), 2170 states have call successors, (2198) [2022-11-02 20:45:49,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14078 states to 14078 states and 19785 transitions. [2022-11-02 20:45:49,677 INFO L78 Accepts]: Start accepts. Automaton has 14078 states and 19785 transitions. Word has length 120 [2022-11-02 20:45:49,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:49,678 INFO L495 AbstractCegarLoop]: Abstraction has 14078 states and 19785 transitions. [2022-11-02 20:45:49,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-02 20:45:49,678 INFO L276 IsEmpty]: Start isEmpty. Operand 14078 states and 19785 transitions. [2022-11-02 20:45:49,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-02 20:45:49,684 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:49,684 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2022-11-02 20:45:49,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64887294-b4a3-4080-93b9-5526b7102894/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:45:49,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64887294-b4a3-4080-93b9-5526b7102894/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-02 20:45:49,899 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:45:49,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:49,899 INFO L85 PathProgramCache]: Analyzing trace with hash 559133422, now seen corresponding path program 1 times [2022-11-02 20:45:49,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:49,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133013064] [2022-11-02 20:45:49,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:49,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:45:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:45:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:45:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 20:45:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:45:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:45:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:51,131 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-02 20:45:51,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:51,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133013064] [2022-11-02 20:45:51,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133013064] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:51,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:51,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:45:51,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514054512] [2022-11-02 20:45:51,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:51,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:45:51,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:51,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:45:51,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:45:51,134 INFO L87 Difference]: Start difference. First operand 14078 states and 19785 transitions. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 20:45:55,860 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,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:46:02,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:02,027 INFO L93 Difference]: Finished difference Result 41426 states and 60219 transitions. [2022-11-02 20:46:02,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:46:02,027 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 145 [2022-11-02 20:46:02,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:02,115 INFO L225 Difference]: With dead ends: 41426 [2022-11-02 20:46:02,115 INFO L226 Difference]: Without dead ends: 27351 [2022-11-02 20:46:02,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:46:02,142 INFO L413 NwaCegarLoop]: 984 mSDtfsCounter, 1105 mSDsluCounter, 3263 mSDsCounter, 0 mSdLazyCounter, 1971 mSolverCounterSat, 388 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1172 SdHoareTripleChecker+Valid, 4247 SdHoareTripleChecker+Invalid, 2361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 1971 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:02,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1172 Valid, 4247 Invalid, 2361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 1971 Invalid, 2 Unknown, 0 Unchecked, 9.7s Time] [2022-11-02 20:46:02,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27351 states. [2022-11-02 20:46:03,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27351 to 14036. [2022-11-02 20:46:03,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14036 states, 11090 states have (on average 1.3801623083859333) internal successors, (15306), 11208 states have internal predecessors, (15306), 2183 states have call successors, (2183), 787 states have call predecessors, (2183), 762 states have return successors, (2198), 2124 states have call predecessors, (2198), 2170 states have call successors, (2198) [2022-11-02 20:46:03,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14036 states to 14036 states and 19687 transitions. [2022-11-02 20:46:03,089 INFO L78 Accepts]: Start accepts. Automaton has 14036 states and 19687 transitions. Word has length 145 [2022-11-02 20:46:03,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:03,089 INFO L495 AbstractCegarLoop]: Abstraction has 14036 states and 19687 transitions. [2022-11-02 20:46:03,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 20:46:03,090 INFO L276 IsEmpty]: Start isEmpty. Operand 14036 states and 19687 transitions. [2022-11-02 20:46:03,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-11-02 20:46:03,095 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:03,095 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2022-11-02 20:46:03,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:46:03,096 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:46:03,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:03,096 INFO L85 PathProgramCache]: Analyzing trace with hash 823178437, now seen corresponding path program 1 times [2022-11-02 20:46:03,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:03,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123237994] [2022-11-02 20:46:03,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:03,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:03,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:46:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:03,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:03,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:46:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:03,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:03,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:46:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:03,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:04,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:46:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:04,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:04,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:04,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:46:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:04,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 20:46:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:04,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:04,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:46:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:04,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:46:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:04,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 20:46:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:04,059 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-02 20:46:04,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:04,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123237994] [2022-11-02 20:46:04,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123237994] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:04,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:04,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:46:04,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571546292] [2022-11-02 20:46:04,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:04,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:46:04,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:04,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:46:04,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:46:04,062 INFO L87 Difference]: Start difference. First operand 14036 states and 19687 transitions. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-02 20:46:08,154 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:11,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:11,938 INFO L93 Difference]: Finished difference Result 42564 states and 61847 transitions. [2022-11-02 20:46:11,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:46:11,938 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 148 [2022-11-02 20:46:11,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:12,003 INFO L225 Difference]: With dead ends: 42564 [2022-11-02 20:46:12,004 INFO L226 Difference]: Without dead ends: 28531 [2022-11-02 20:46:12,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:46:12,043 INFO L413 NwaCegarLoop]: 1446 mSDtfsCounter, 1161 mSDsluCounter, 4293 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 618 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1232 SdHoareTripleChecker+Valid, 5739 SdHoareTripleChecker+Invalid, 2280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 618 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:12,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1232 Valid, 5739 Invalid, 2280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [618 Valid, 1661 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2022-11-02 20:46:12,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28531 states. [2022-11-02 20:46:13,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28531 to 14064. [2022-11-02 20:46:13,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14064 states, 11118 states have (on average 1.379204892966361) internal successors, (15334), 11236 states have internal predecessors, (15334), 2183 states have call successors, (2183), 787 states have call predecessors, (2183), 762 states have return successors, (2198), 2124 states have call predecessors, (2198), 2170 states have call successors, (2198) [2022-11-02 20:46:13,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14064 states to 14064 states and 19715 transitions. [2022-11-02 20:46:13,053 INFO L78 Accepts]: Start accepts. Automaton has 14064 states and 19715 transitions. Word has length 148 [2022-11-02 20:46:13,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:13,053 INFO L495 AbstractCegarLoop]: Abstraction has 14064 states and 19715 transitions. [2022-11-02 20:46:13,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-02 20:46:13,053 INFO L276 IsEmpty]: Start isEmpty. Operand 14064 states and 19715 transitions. [2022-11-02 20:46:13,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-11-02 20:46:13,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:13,059 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2022-11-02 20:46:13,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:46:13,059 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:46:13,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:13,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1681591430, now seen corresponding path program 1 times [2022-11-02 20:46:13,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:13,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626205935] [2022-11-02 20:46:13,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:13,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:13,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:46:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:13,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:13,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:13,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:46:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:13,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:13,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:46:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:13,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:13,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:46:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:13,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:13,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:46:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:13,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 20:46:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:13,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:13,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:46:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:13,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:46:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:13,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 20:46:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:13,786 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-02 20:46:13,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:13,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626205935] [2022-11-02 20:46:13,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626205935] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:13,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:13,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:46:13,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539058926] [2022-11-02 20:46:13,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:13,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:46:13,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:13,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:46:13,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:46:13,791 INFO L87 Difference]: Start difference. First operand 14064 states and 19715 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-02 20:46:18,523 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:20,985 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:24,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:24,921 INFO L93 Difference]: Finished difference Result 45458 states and 64413 transitions. [2022-11-02 20:46:24,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:46:24,921 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 148 [2022-11-02 20:46:24,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:24,996 INFO L225 Difference]: With dead ends: 45458 [2022-11-02 20:46:24,996 INFO L226 Difference]: Without dead ends: 31397 [2022-11-02 20:46:25,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:46:25,022 INFO L413 NwaCegarLoop]: 768 mSDtfsCounter, 2035 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 1378 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2108 SdHoareTripleChecker+Valid, 2267 SdHoareTripleChecker+Invalid, 2730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1378 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:25,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2108 Valid, 2267 Invalid, 2730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1378 Valid, 1350 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2022-11-02 20:46:25,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31397 states. [2022-11-02 20:46:26,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31397 to 27546. [2022-11-02 20:46:26,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27546 states, 21778 states have (on average 1.3768941133253743) internal successors, (29986), 22024 states have internal predecessors, (29986), 4245 states have call successors, (4245), 1569 states have call predecessors, (4245), 1522 states have return successors, (4282), 4120 states have call predecessors, (4282), 4226 states have call successors, (4282) [2022-11-02 20:46:26,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27546 states to 27546 states and 38513 transitions. [2022-11-02 20:46:26,643 INFO L78 Accepts]: Start accepts. Automaton has 27546 states and 38513 transitions. Word has length 148 [2022-11-02 20:46:26,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:26,644 INFO L495 AbstractCegarLoop]: Abstraction has 27546 states and 38513 transitions. [2022-11-02 20:46:26,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-02 20:46:26,644 INFO L276 IsEmpty]: Start isEmpty. Operand 27546 states and 38513 transitions. [2022-11-02 20:46:26,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-11-02 20:46:26,651 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:26,651 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:26,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:46:26,652 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:46:26,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:26,652 INFO L85 PathProgramCache]: Analyzing trace with hash 606760287, now seen corresponding path program 1 times [2022-11-02 20:46:26,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:26,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906826477] [2022-11-02 20:46:26,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:26,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:27,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:46:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:27,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:27,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:46:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:27,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:27,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:46:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:27,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:27,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:46:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:27,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-02 20:46:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:27,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 20:46:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:27,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 20:46:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:27,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:27,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:46:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:27,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:27,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 20:46:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:27,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-02 20:46:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:27,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-02 20:46:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:27,518 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-02 20:46:27,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:27,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906826477] [2022-11-02 20:46:27,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906826477] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:27,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:27,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:46:27,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778428482] [2022-11-02 20:46:27,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:27,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:46:27,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:27,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:46:27,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:46:27,521 INFO L87 Difference]: Start difference. First operand 27546 states and 38513 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-02 20:46:31,458 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:33,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:46:36,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:36,387 INFO L93 Difference]: Finished difference Result 46673 states and 64935 transitions. [2022-11-02 20:46:36,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:46:36,395 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 159 [2022-11-02 20:46:36,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:36,445 INFO L225 Difference]: With dead ends: 46673 [2022-11-02 20:46:36,445 INFO L226 Difference]: Without dead ends: 19130 [2022-11-02 20:46:36,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:46:36,492 INFO L413 NwaCegarLoop]: 694 mSDtfsCounter, 1273 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 695 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1311 SdHoareTripleChecker+Valid, 2062 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 695 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:36,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1311 Valid, 2062 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [695 Valid, 906 Invalid, 2 Unknown, 0 Unchecked, 7.4s Time] [2022-11-02 20:46:36,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19130 states. [2022-11-02 20:46:37,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19130 to 12295. [2022-11-02 20:46:37,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12295 states, 9689 states have (on average 1.394984002477036) internal successors, (13516), 9809 states have internal predecessors, (13516), 1931 states have call successors, (1931), 699 states have call predecessors, (1931), 674 states have return successors, (1946), 1870 states have call predecessors, (1946), 1918 states have call successors, (1946) [2022-11-02 20:46:37,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12295 states to 12295 states and 17393 transitions. [2022-11-02 20:46:37,459 INFO L78 Accepts]: Start accepts. Automaton has 12295 states and 17393 transitions. Word has length 159 [2022-11-02 20:46:37,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:37,460 INFO L495 AbstractCegarLoop]: Abstraction has 12295 states and 17393 transitions. [2022-11-02 20:46:37,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-02 20:46:37,461 INFO L276 IsEmpty]: Start isEmpty. Operand 12295 states and 17393 transitions. [2022-11-02 20:46:37,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-11-02 20:46:37,468 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:37,469 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2022-11-02 20:46:37,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:46:37,469 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:46:37,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:37,470 INFO L85 PathProgramCache]: Analyzing trace with hash -577394368, now seen corresponding path program 1 times [2022-11-02 20:46:37,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:37,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984621121] [2022-11-02 20:46:37,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:37,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:46:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:46:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:46:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:38,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:46:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-02 20:46:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:46:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-02 20:46:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:46:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:46:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-02 20:46:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:38,543 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-02 20:46:38,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:38,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984621121] [2022-11-02 20:46:38,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984621121] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:46:38,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246668934] [2022-11-02 20:46:38,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:38,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:38,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64887294-b4a3-4080-93b9-5526b7102894/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:46:38,545 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64887294-b4a3-4080-93b9-5526b7102894/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:46:38,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64887294-b4a3-4080-93b9-5526b7102894/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:46:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:40,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 12546 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:46:40,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:46:40,798 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-02 20:46:40,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:46:40,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246668934] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:40,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:46:40,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2022-11-02 20:46:40,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562295070] [2022-11-02 20:46:40,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:40,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:46:40,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:40,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:46:40,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:46:40,801 INFO L87 Difference]: Start difference. First operand 12295 states and 17393 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-02 20:46:41,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:41,972 INFO L93 Difference]: Finished difference Result 24587 states and 34779 transitions. [2022-11-02 20:46:41,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:46:41,973 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 167 [2022-11-02 20:46:41,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:42,007 INFO L225 Difference]: With dead ends: 24587 [2022-11-02 20:46:42,007 INFO L226 Difference]: Without dead ends: 12302 [2022-11-02 20:46:42,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:46:42,030 INFO L413 NwaCegarLoop]: 786 mSDtfsCounter, 27 mSDsluCounter, 3092 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3878 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:42,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3878 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:46:42,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12302 states. [2022-11-02 20:46:42,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12302 to 12197. [2022-11-02 20:46:42,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12197 states, 9607 states have (on average 1.3954408243988758) internal successors, (13406), 9729 states have internal predecessors, (13406), 1922 states have call successors, (1922), 692 states have call predecessors, (1922), 667 states have return successors, (1937), 1859 states have call predecessors, (1937), 1909 states have call successors, (1937) [2022-11-02 20:46:42,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12197 states to 12197 states and 17265 transitions. [2022-11-02 20:46:42,868 INFO L78 Accepts]: Start accepts. Automaton has 12197 states and 17265 transitions. Word has length 167 [2022-11-02 20:46:42,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:42,868 INFO L495 AbstractCegarLoop]: Abstraction has 12197 states and 17265 transitions. [2022-11-02 20:46:42,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-02 20:46:42,868 INFO L276 IsEmpty]: Start isEmpty. Operand 12197 states and 17265 transitions. [2022-11-02 20:46:42,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-11-02 20:46:42,873 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:42,873 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2022-11-02 20:46:42,927 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64887294-b4a3-4080-93b9-5526b7102894/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:46:43,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64887294-b4a3-4080-93b9-5526b7102894/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-02 20:46:43,087 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:46:43,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:43,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1326215580, now seen corresponding path program 1 times [2022-11-02 20:46:43,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:43,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380617042] [2022-11-02 20:46:43,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:43,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:44,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:46:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:44,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:44,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:46:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:44,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:44,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:46:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:44,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:44,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:46:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:44,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-02 20:46:44,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:44,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:44,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:46:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:44,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-02 20:46:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:44,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:44,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:44,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:46:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:44,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:46:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:44,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-02 20:46:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:44,109 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-02 20:46:44,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:44,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380617042] [2022-11-02 20:46:44,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380617042] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:46:44,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645671717] [2022-11-02 20:46:44,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:44,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:44,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64887294-b4a3-4080-93b9-5526b7102894/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:46:44,111 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64887294-b4a3-4080-93b9-5526b7102894/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:46:44,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64887294-b4a3-4080-93b9-5526b7102894/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:46:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:46,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 12607 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:46:46,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:46:46,591 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-02 20:46:46,591 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:46:46,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645671717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:46,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:46:46,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-11-02 20:46:46,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198261971] [2022-11-02 20:46:46,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:46,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:46:46,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:46,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:46:46,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:46:46,594 INFO L87 Difference]: Start difference. First operand 12197 states and 17265 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-02 20:46:49,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:49,945 INFO L93 Difference]: Finished difference Result 36554 states and 51747 transitions. [2022-11-02 20:46:49,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:46:49,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 168 [2022-11-02 20:46:49,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:50,071 INFO L225 Difference]: With dead ends: 36554 [2022-11-02 20:46:50,071 INFO L226 Difference]: Without dead ends: 36539 [2022-11-02 20:46:50,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:46:50,090 INFO L413 NwaCegarLoop]: 1525 mSDtfsCounter, 1507 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 2875 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:50,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 2875 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:46:50,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36539 states. [2022-11-02 20:46:52,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36539 to 36477. [2022-11-02 20:46:52,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36477 states, 28731 states have (on average 1.3953569315373637) internal successors, (40090), 29089 states have internal predecessors, (40090), 5748 states have call successors, (5748), 2066 states have call predecessors, (5748), 1997 states have return successors, (5807), 5573 states have call predecessors, (5807), 5723 states have call successors, (5807) [2022-11-02 20:46:52,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36477 states to 36477 states and 51645 transitions. [2022-11-02 20:46:52,616 INFO L78 Accepts]: Start accepts. Automaton has 36477 states and 51645 transitions. Word has length 168 [2022-11-02 20:46:52,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:52,617 INFO L495 AbstractCegarLoop]: Abstraction has 36477 states and 51645 transitions. [2022-11-02 20:46:52,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-02 20:46:52,617 INFO L276 IsEmpty]: Start isEmpty. Operand 36477 states and 51645 transitions. [2022-11-02 20:46:52,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-11-02 20:46:52,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:52,627 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-11-02 20:46:52,672 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64887294-b4a3-4080-93b9-5526b7102894/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-02 20:46:52,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64887294-b4a3-4080-93b9-5526b7102894/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-02 20:46:52,827 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:46:52,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:52,828 INFO L85 PathProgramCache]: Analyzing trace with hash 508576284, now seen corresponding path program 1 times [2022-11-02 20:46:52,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:52,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705085508] [2022-11-02 20:46:52,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:52,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:46:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:46:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:46:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:46:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-02 20:46:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:46:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-02 20:46:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-02 20:46:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 20:46:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:46:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:46:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-02 20:46:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-02 20:46:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-11-02 20:46:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:53,667 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-02 20:46:53,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:53,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705085508] [2022-11-02 20:46:53,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705085508] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:53,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:53,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:46:53,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061479508] [2022-11-02 20:46:53,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:53,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:46:53,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:53,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:46:53,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:46:53,672 INFO L87 Difference]: Start difference. First operand 36477 states and 51645 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)