./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-queue-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/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_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-queue-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/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 32bit --witnessprinter.graph.data.programhash af4a0e4f738e916feae01fb2c2f056f4ba7834b8a7b8d69765614c5417c16c63 --- 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:45:16,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:45:16,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:45:16,424 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:45:16,424 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:45:16,428 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:45:16,431 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:45:16,436 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:45:16,438 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:45:16,445 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:45:16,446 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:45:16,449 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:45:16,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:45:16,450 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:45:16,451 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:45:16,452 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:45:16,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:45:16,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:45:16,455 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:45:16,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:45:16,458 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:45:16,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:45:16,467 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:45:16,468 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:45:16,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:45:16,483 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:45:16,483 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:45:16,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:45:16,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:45:16,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:45:16,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:45:16,486 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:45:16,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:45:16,488 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:45:16,489 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:45:16,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:45:16,490 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:45:16,491 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:45:16,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:45:16,492 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:45:16,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:45:16,497 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:45:16,516 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:45:16,517 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:45:16,517 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:45:16,517 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:45:16,518 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:45:16,518 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:45:16,519 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:45:16,519 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:45:16,519 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:45:16,519 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:45:16,520 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:45:16,520 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:45:16,520 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:45:16,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:45:16,520 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:45:16,520 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:45:16,521 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:45:16,521 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:45:16,521 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:45:16,521 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:45:16,521 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:45:16,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:45:16,522 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:45:16,522 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:45:16,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:45:16,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:45:16,523 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:45:16,523 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:45:16,523 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:45:16,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:45:16,523 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:45:16,523 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:45:16,524 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:45:16,524 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_65f5295f-dd6e-4509-b2b1-4052886a91ff/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_65f5295f-dd6e-4509-b2b1-4052886a91ff/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> af4a0e4f738e916feae01fb2c2f056f4ba7834b8a7b8d69765614c5417c16c63 [2022-11-02 20:45:16,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:45:16,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:45:16,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:45:16,863 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:45:16,864 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:45:16,865 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/forester-heap/sll-queue-2.i [2022-11-02 20:45:16,955 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/data/a814156fa/7b719dc8bfa94b80a3a552244ce94d7a/FLAG408401fa7 [2022-11-02 20:45:17,474 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:45:17,475 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/sv-benchmarks/c/forester-heap/sll-queue-2.i [2022-11-02 20:45:17,509 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/data/a814156fa/7b719dc8bfa94b80a3a552244ce94d7a/FLAG408401fa7 [2022-11-02 20:45:17,818 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/data/a814156fa/7b719dc8bfa94b80a3a552244ce94d7a [2022-11-02 20:45:17,823 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:45:17,825 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:45:17,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:45:17,829 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:45:17,833 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:45:17,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:45:17" (1/1) ... [2022-11-02 20:45:17,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@299439ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:17, skipping insertion in model container [2022-11-02 20:45:17,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:45:17" (1/1) ... [2022-11-02 20:45:17,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:45:17,904 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:45:18,237 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_65f5295f-dd6e-4509-b2b1-4052886a91ff/sv-benchmarks/c/forester-heap/sll-queue-2.i[22387,22400] [2022-11-02 20:45:18,242 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_65f5295f-dd6e-4509-b2b1-4052886a91ff/sv-benchmarks/c/forester-heap/sll-queue-2.i[22458,22471] [2022-11-02 20:45:18,244 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_65f5295f-dd6e-4509-b2b1-4052886a91ff/sv-benchmarks/c/forester-heap/sll-queue-2.i[22532,22545] [2022-11-02 20:45:18,245 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_65f5295f-dd6e-4509-b2b1-4052886a91ff/sv-benchmarks/c/forester-heap/sll-queue-2.i[22624,22637] [2022-11-02 20:45:18,246 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_65f5295f-dd6e-4509-b2b1-4052886a91ff/sv-benchmarks/c/forester-heap/sll-queue-2.i[22701,22714] [2022-11-02 20:45:18,247 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_65f5295f-dd6e-4509-b2b1-4052886a91ff/sv-benchmarks/c/forester-heap/sll-queue-2.i[22796,22809] [2022-11-02 20:45:18,249 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_65f5295f-dd6e-4509-b2b1-4052886a91ff/sv-benchmarks/c/forester-heap/sll-queue-2.i[22873,22886] [2022-11-02 20:45:18,250 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_65f5295f-dd6e-4509-b2b1-4052886a91ff/sv-benchmarks/c/forester-heap/sll-queue-2.i[22956,22969] [2022-11-02 20:45:18,251 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_65f5295f-dd6e-4509-b2b1-4052886a91ff/sv-benchmarks/c/forester-heap/sll-queue-2.i[23051,23064] [2022-11-02 20:45:18,252 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_65f5295f-dd6e-4509-b2b1-4052886a91ff/sv-benchmarks/c/forester-heap/sll-queue-2.i[23128,23141] [2022-11-02 20:45:18,253 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_65f5295f-dd6e-4509-b2b1-4052886a91ff/sv-benchmarks/c/forester-heap/sll-queue-2.i[23211,23224] [2022-11-02 20:45:18,254 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_65f5295f-dd6e-4509-b2b1-4052886a91ff/sv-benchmarks/c/forester-heap/sll-queue-2.i[23300,23313] [2022-11-02 20:45:18,256 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_65f5295f-dd6e-4509-b2b1-4052886a91ff/sv-benchmarks/c/forester-heap/sll-queue-2.i[23386,23399] [2022-11-02 20:45:18,258 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_65f5295f-dd6e-4509-b2b1-4052886a91ff/sv-benchmarks/c/forester-heap/sll-queue-2.i[23532,23545] [2022-11-02 20:45:18,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:45:18,270 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:45:18,307 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_65f5295f-dd6e-4509-b2b1-4052886a91ff/sv-benchmarks/c/forester-heap/sll-queue-2.i[22387,22400] [2022-11-02 20:45:18,308 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_65f5295f-dd6e-4509-b2b1-4052886a91ff/sv-benchmarks/c/forester-heap/sll-queue-2.i[22458,22471] [2022-11-02 20:45:18,309 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_65f5295f-dd6e-4509-b2b1-4052886a91ff/sv-benchmarks/c/forester-heap/sll-queue-2.i[22532,22545] [2022-11-02 20:45:18,310 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_65f5295f-dd6e-4509-b2b1-4052886a91ff/sv-benchmarks/c/forester-heap/sll-queue-2.i[22624,22637] [2022-11-02 20:45:18,311 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_65f5295f-dd6e-4509-b2b1-4052886a91ff/sv-benchmarks/c/forester-heap/sll-queue-2.i[22701,22714] [2022-11-02 20:45:18,312 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_65f5295f-dd6e-4509-b2b1-4052886a91ff/sv-benchmarks/c/forester-heap/sll-queue-2.i[22796,22809] [2022-11-02 20:45:18,313 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_65f5295f-dd6e-4509-b2b1-4052886a91ff/sv-benchmarks/c/forester-heap/sll-queue-2.i[22873,22886] [2022-11-02 20:45:18,315 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_65f5295f-dd6e-4509-b2b1-4052886a91ff/sv-benchmarks/c/forester-heap/sll-queue-2.i[22956,22969] [2022-11-02 20:45:18,316 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_65f5295f-dd6e-4509-b2b1-4052886a91ff/sv-benchmarks/c/forester-heap/sll-queue-2.i[23051,23064] [2022-11-02 20:45:18,317 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_65f5295f-dd6e-4509-b2b1-4052886a91ff/sv-benchmarks/c/forester-heap/sll-queue-2.i[23128,23141] [2022-11-02 20:45:18,318 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_65f5295f-dd6e-4509-b2b1-4052886a91ff/sv-benchmarks/c/forester-heap/sll-queue-2.i[23211,23224] [2022-11-02 20:45:18,320 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_65f5295f-dd6e-4509-b2b1-4052886a91ff/sv-benchmarks/c/forester-heap/sll-queue-2.i[23300,23313] [2022-11-02 20:45:18,321 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_65f5295f-dd6e-4509-b2b1-4052886a91ff/sv-benchmarks/c/forester-heap/sll-queue-2.i[23386,23399] [2022-11-02 20:45:18,323 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_65f5295f-dd6e-4509-b2b1-4052886a91ff/sv-benchmarks/c/forester-heap/sll-queue-2.i[23532,23545] [2022-11-02 20:45:18,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:45:18,352 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:45:18,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:18 WrapperNode [2022-11-02 20:45:18,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:45:18,354 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:45:18,355 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:45:18,355 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:45:18,364 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:45:18" (1/1) ... [2022-11-02 20:45:18,404 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:45:18" (1/1) ... [2022-11-02 20:45:18,448 INFO L138 Inliner]: procedures = 119, calls = 35, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 219 [2022-11-02 20:45:18,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:45:18,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:45:18,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:45:18,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:45:18,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:18" (1/1) ... [2022-11-02 20:45:18,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:18" (1/1) ... [2022-11-02 20:45:18,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:18" (1/1) ... [2022-11-02 20:45:18,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:18" (1/1) ... [2022-11-02 20:45:18,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:18" (1/1) ... [2022-11-02 20:45:18,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:18" (1/1) ... [2022-11-02 20:45:18,510 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:18" (1/1) ... [2022-11-02 20:45:18,520 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:18" (1/1) ... [2022-11-02 20:45:18,523 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:45:18,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:45:18,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:45:18,525 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:45:18,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:18" (1/1) ... [2022-11-02 20:45:18,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:45:18,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:18,570 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:45:18,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:45:18,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:45:18,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:45:18,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:45:18,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:45:18,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:45:18,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:45:18,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:45:18,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:45:18,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:45:18,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:45:18,777 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:45:18,780 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:45:19,176 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:45:19,189 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:45:19,189 INFO L300 CfgBuilder]: Removed 31 assume(true) statements. [2022-11-02 20:45:19,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:45:19 BoogieIcfgContainer [2022-11-02 20:45:19,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:45:19,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:45:19,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:45:19,202 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:45:19,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:45:17" (1/3) ... [2022-11-02 20:45:19,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ee1d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:45:19, skipping insertion in model container [2022-11-02 20:45:19,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:18" (2/3) ... [2022-11-02 20:45:19,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ee1d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:45:19, skipping insertion in model container [2022-11-02 20:45:19,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:45:19" (3/3) ... [2022-11-02 20:45:19,207 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-queue-2.i [2022-11-02 20:45:19,231 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:45:19,231 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-11-02 20:45:19,311 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:45:19,329 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;@5e179627, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:45:19,330 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-02 20:45:19,335 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 70 states have (on average 2.0) internal successors, (140), 84 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:19,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:45:19,343 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:19,345 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:45:19,346 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-11-02 20:45:19,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:19,351 INFO L85 PathProgramCache]: Analyzing trace with hash 28752478, now seen corresponding path program 1 times [2022-11-02 20:45:19,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:19,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838255947] [2022-11-02 20:45:19,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:19,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:19,644 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:45:19,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:19,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838255947] [2022-11-02 20:45:19,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838255947] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:19,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:19,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:45:19,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821384871] [2022-11-02 20:45:19,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:19,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:45:19,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:19,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:45:19,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:45:19,733 INFO L87 Difference]: Start difference. First operand has 85 states, 70 states have (on average 2.0) internal successors, (140), 84 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:19,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:19,782 INFO L93 Difference]: Finished difference Result 168 states and 278 transitions. [2022-11-02 20:45:19,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:45:19,784 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-02 20:45:19,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:19,805 INFO L225 Difference]: With dead ends: 168 [2022-11-02 20:45:19,805 INFO L226 Difference]: Without dead ends: 80 [2022-11-02 20:45:19,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:45:19,811 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:19,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:45:19,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-02 20:45:19,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-02 20:45:19,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 79 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:19,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2022-11-02 20:45:19,850 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 5 [2022-11-02 20:45:19,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:19,850 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2022-11-02 20:45:19,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:19,851 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-11-02 20:45:19,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:45:19,851 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:19,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:45:19,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:45:19,852 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-11-02 20:45:19,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:19,853 INFO L85 PathProgramCache]: Analyzing trace with hash 889571111, now seen corresponding path program 1 times [2022-11-02 20:45:19,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:19,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211117763] [2022-11-02 20:45:19,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:19,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:19,920 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:45:19,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:19,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211117763] [2022-11-02 20:45:19,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211117763] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:19,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:19,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:45:19,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520776130] [2022-11-02 20:45:19,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:19,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:45:19,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:19,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:45:19,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:45:19,925 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:19,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:19,970 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2022-11-02 20:45:19,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:45:19,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-02 20:45:19,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:19,972 INFO L225 Difference]: With dead ends: 80 [2022-11-02 20:45:19,972 INFO L226 Difference]: Without dead ends: 70 [2022-11-02 20:45:19,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:45:19,974 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 75 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:19,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 67 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:45:19,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-02 20:45:19,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-02 20:45:19,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 69 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:19,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2022-11-02 20:45:19,985 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 6 [2022-11-02 20:45:19,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:19,985 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2022-11-02 20:45:19,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:19,986 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2022-11-02 20:45:19,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:45:19,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:19,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:19,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:45:19,987 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-11-02 20:45:19,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:19,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1270244236, now seen corresponding path program 1 times [2022-11-02 20:45:19,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:19,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003220692] [2022-11-02 20:45:19,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:19,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:20,074 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:45:20,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:20,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003220692] [2022-11-02 20:45:20,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003220692] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:20,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:20,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:45:20,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685837056] [2022-11-02 20:45:20,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:20,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:45:20,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:20,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:45:20,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:45:20,078 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:20,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:20,119 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2022-11-02 20:45:20,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:45:20,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-02 20:45:20,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:20,121 INFO L225 Difference]: With dead ends: 70 [2022-11-02 20:45:20,121 INFO L226 Difference]: Without dead ends: 68 [2022-11-02 20:45:20,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:45:20,123 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 58 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:20,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 82 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:45:20,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-02 20:45:20,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-02 20:45:20,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 67 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:20,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-11-02 20:45:20,144 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 9 [2022-11-02 20:45:20,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:20,144 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-11-02 20:45:20,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:20,145 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-11-02 20:45:20,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:45:20,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:20,151 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:20,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:45:20,152 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-11-02 20:45:20,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:20,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1286414876, now seen corresponding path program 1 times [2022-11-02 20:45:20,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:20,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547137742] [2022-11-02 20:45:20,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:20,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:20,262 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:45:20,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:20,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547137742] [2022-11-02 20:45:20,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547137742] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:20,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:20,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:45:20,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625304487] [2022-11-02 20:45:20,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:20,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:45:20,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:20,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:45:20,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:45:20,266 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:20,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:20,324 INFO L93 Difference]: Finished difference Result 153 states and 178 transitions. [2022-11-02 20:45:20,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:45:20,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-02 20:45:20,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:20,333 INFO L225 Difference]: With dead ends: 153 [2022-11-02 20:45:20,334 INFO L226 Difference]: Without dead ends: 87 [2022-11-02 20:45:20,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:45:20,335 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 17 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:20,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 135 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:45:20,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-02 20:45:20,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2022-11-02 20:45:20,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 75 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:20,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2022-11-02 20:45:20,357 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 12 [2022-11-02 20:45:20,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:20,357 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2022-11-02 20:45:20,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:20,358 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2022-11-02 20:45:20,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:45:20,358 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:20,358 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:20,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:45:20,359 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-11-02 20:45:20,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:20,360 INFO L85 PathProgramCache]: Analyzing trace with hash -138012862, now seen corresponding path program 1 times [2022-11-02 20:45:20,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:20,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633683512] [2022-11-02 20:45:20,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:20,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:20,757 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:45:20,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:20,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633683512] [2022-11-02 20:45:20,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633683512] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:20,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:20,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:45:20,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250764191] [2022-11-02 20:45:20,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:20,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:45:20,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:20,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:45:20,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:45:20,760 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:20,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:20,923 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2022-11-02 20:45:20,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:45:20,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-02 20:45:20,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:20,925 INFO L225 Difference]: With dead ends: 91 [2022-11-02 20:45:20,925 INFO L226 Difference]: Without dead ends: 71 [2022-11-02 20:45:20,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:45:20,927 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 6 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:20,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 265 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:45:20,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-02 20:45:20,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-02 20:45:20,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 63 states have (on average 1.253968253968254) internal successors, (79), 70 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2022-11-02 20:45:20,937 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 17 [2022-11-02 20:45:20,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:20,937 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2022-11-02 20:45:20,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2022-11-02 20:45:20,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:45:20,938 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:20,939 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:20,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:45:20,939 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-11-02 20:45:20,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:20,940 INFO L85 PathProgramCache]: Analyzing trace with hash -472870040, now seen corresponding path program 1 times [2022-11-02 20:45:20,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:20,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184627950] [2022-11-02 20:45:20,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:20,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:21,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:45:21,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:21,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184627950] [2022-11-02 20:45:21,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184627950] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:45:21,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314548600] [2022-11-02 20:45:21,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:21,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:21,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:21,416 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:21,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:45:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:21,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-02 20:45:21,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:21,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:45:21,799 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:45:21,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:45:21,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-02 20:45:21,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:45:21,899 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:45:21,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-02 20:45:22,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-02 20:45:22,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:45:22,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:45:22,163 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_163 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-11-02 20:45:22,216 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:45:22,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2022-11-02 20:45:22,229 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:45:22,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2022-11-02 20:45:22,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-11-02 20:45:22,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:45:22,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314548600] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:45:22,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:45:22,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-11-02 20:45:22,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316728901] [2022-11-02 20:45:22,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:45:22,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:45:22,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:22,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:45:22,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=81, Unknown=1, NotChecked=18, Total=132 [2022-11-02 20:45:22,381 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:22,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:22,624 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2022-11-02 20:45:22,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:45:22,625 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 20:45:22,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:22,630 INFO L225 Difference]: With dead ends: 144 [2022-11-02 20:45:22,630 INFO L226 Difference]: Without dead ends: 142 [2022-11-02 20:45:22,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=95, Unknown=1, NotChecked=20, Total=156 [2022-11-02 20:45:22,637 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 246 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:22,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 452 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 154 Invalid, 0 Unknown, 95 Unchecked, 0.2s Time] [2022-11-02 20:45:22,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-11-02 20:45:22,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 84. [2022-11-02 20:45:22,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.236842105263158) internal successors, (94), 83 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:22,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2022-11-02 20:45:22,662 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 19 [2022-11-02 20:45:22,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:22,662 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2022-11-02 20:45:22,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:22,663 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2022-11-02 20:45:22,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 20:45:22,666 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:22,666 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:22,712 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-02 20:45:22,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:22,881 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-11-02 20:45:22,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:22,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1456359625, now seen corresponding path program 1 times [2022-11-02 20:45:22,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:22,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670669811] [2022-11-02 20:45:22,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:22,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:22,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:45:22,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:22,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670669811] [2022-11-02 20:45:22,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670669811] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:22,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:22,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:45:22,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763099296] [2022-11-02 20:45:22,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:22,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:45:22,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:22,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:45:22,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:45:22,924 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:22,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:22,977 INFO L93 Difference]: Finished difference Result 174 states and 199 transitions. [2022-11-02 20:45:22,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:45:22,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-02 20:45:22,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:22,979 INFO L225 Difference]: With dead ends: 174 [2022-11-02 20:45:22,979 INFO L226 Difference]: Without dead ends: 108 [2022-11-02 20:45:22,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:45:22,981 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 24 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:22,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 127 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:45:22,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-02 20:45:22,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2022-11-02 20:45:22,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 89 states have (on average 1.202247191011236) internal successors, (107), 96 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:22,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2022-11-02 20:45:22,994 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 20 [2022-11-02 20:45:22,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:22,995 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2022-11-02 20:45:22,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:22,995 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2022-11-02 20:45:22,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:45:22,996 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:22,996 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:22,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:45:22,997 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-11-02 20:45:22,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:22,997 INFO L85 PathProgramCache]: Analyzing trace with hash 886899864, now seen corresponding path program 1 times [2022-11-02 20:45:22,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:22,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700082083] [2022-11-02 20:45:22,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:22,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:23,074 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:45:23,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:23,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700082083] [2022-11-02 20:45:23,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700082083] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:23,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:23,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:45:23,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109910381] [2022-11-02 20:45:23,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:23,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:45:23,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:23,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:45:23,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:45:23,077 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:23,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:23,125 INFO L93 Difference]: Finished difference Result 201 states and 228 transitions. [2022-11-02 20:45:23,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:45:23,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-02 20:45:23,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:23,127 INFO L225 Difference]: With dead ends: 201 [2022-11-02 20:45:23,127 INFO L226 Difference]: Without dead ends: 122 [2022-11-02 20:45:23,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:45:23,128 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 30 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:23,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 142 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:45:23,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-02 20:45:23,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2022-11-02 20:45:23,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 109 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:23,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-11-02 20:45:23,143 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 27 [2022-11-02 20:45:23,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:23,143 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-11-02 20:45:23,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:23,144 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-11-02 20:45:23,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:45:23,145 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:23,145 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:23,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:45:23,146 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-11-02 20:45:23,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:23,146 INFO L85 PathProgramCache]: Analyzing trace with hash 2041801735, now seen corresponding path program 1 times [2022-11-02 20:45:23,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:23,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251390034] [2022-11-02 20:45:23,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:23,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:23,677 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:45:23,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:23,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251390034] [2022-11-02 20:45:23,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251390034] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:45:23,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695421902] [2022-11-02 20:45:23,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:23,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:23,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:23,680 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:23,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:45:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:23,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-02 20:45:23,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:23,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:45:23,914 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:45:23,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:45:23,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-02 20:45:23,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:45:23,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:45:24,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:45:24,122 INFO L356 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-02 20:45:24,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 40 [2022-11-02 20:45:24,142 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-02 20:45:24,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-02 20:45:24,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-11-02 20:45:24,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-02 20:45:24,338 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:45:24,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:45:24,380 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_388 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_388) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-11-02 20:45:24,423 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_21| Int) (v_ArrVal_386 (Array Int Int)) (v_ArrVal_388 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_386) |v_ULTIMATE.start_main_~item~0#1.base_21| v_ArrVal_388) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_21|) 0)))) is different from false [2022-11-02 20:45:24,536 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:45:24,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-02 20:45:24,548 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:45:24,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 185 treesize of output 144 [2022-11-02 20:45:24,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 106 [2022-11-02 20:45:24,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2022-11-02 20:45:24,850 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-02 20:45:24,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695421902] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:45:24,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:45:24,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 16 [2022-11-02 20:45:24,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800295690] [2022-11-02 20:45:24,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:45:24,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 20:45:24,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:24,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:45:24,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=140, Unknown=2, NotChecked=50, Total=240 [2022-11-02 20:45:24,853 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:25,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:25,333 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2022-11-02 20:45:25,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:45:25,334 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-02 20:45:25,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:25,337 INFO L225 Difference]: With dead ends: 170 [2022-11-02 20:45:25,338 INFO L226 Difference]: Without dead ends: 168 [2022-11-02 20:45:25,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=230, Unknown=2, NotChecked=66, Total=380 [2022-11-02 20:45:25,342 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 117 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 221 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:25,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 701 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 268 Invalid, 0 Unknown, 221 Unchecked, 0.3s Time] [2022-11-02 20:45:25,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-11-02 20:45:25,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 126. [2022-11-02 20:45:25,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 125 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:25,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2022-11-02 20:45:25,370 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 28 [2022-11-02 20:45:25,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:25,371 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2022-11-02 20:45:25,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:25,371 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2022-11-02 20:45:25,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:45:25,372 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:25,372 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:45:25,415 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:45:25,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:25,595 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-11-02 20:45:25,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:25,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1259768676, now seen corresponding path program 1 times [2022-11-02 20:45:25,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:25,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469364838] [2022-11-02 20:45:25,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:25,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:25,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:45:25,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:25,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469364838] [2022-11-02 20:45:25,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469364838] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:25,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:25,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:45:25,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130870221] [2022-11-02 20:45:25,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:25,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:45:25,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:25,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:45:25,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:45:25,639 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:25,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:25,657 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2022-11-02 20:45:25,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:45:25,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-02 20:45:25,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:25,659 INFO L225 Difference]: With dead ends: 129 [2022-11-02 20:45:25,659 INFO L226 Difference]: Without dead ends: 127 [2022-11-02 20:45:25,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:45:25,660 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:25,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:45:25,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-02 20:45:25,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-11-02 20:45:25,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 119 states have (on average 1.1680672268907564) internal successors, (139), 126 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:25,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 139 transitions. [2022-11-02 20:45:25,672 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 139 transitions. Word has length 29 [2022-11-02 20:45:25,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:25,672 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 139 transitions. [2022-11-02 20:45:25,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:25,673 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 139 transitions. [2022-11-02 20:45:25,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:45:25,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:25,674 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:45:25,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:45:25,674 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-11-02 20:45:25,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:25,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1259766754, now seen corresponding path program 1 times [2022-11-02 20:45:25,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:25,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008891904] [2022-11-02 20:45:25,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:25,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:26,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:45:26,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:26,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008891904] [2022-11-02 20:45:26,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008891904] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:45:26,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783330558] [2022-11-02 20:45:26,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:26,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:26,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:26,461 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:26,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:45:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:26,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-02 20:45:26,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:26,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:45:26,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-02 20:45:26,648 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:45:26,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-02 20:45:26,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:45:26,670 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:45:26,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:45:26,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-02 20:45:26,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:45:26,725 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:45:26,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 45 [2022-11-02 20:45:26,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-02 20:45:26,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 20:45:26,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-02 20:45:26,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:45:27,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:45:27,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:45:27,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:45:27,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 52 [2022-11-02 20:45:27,156 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_506 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_506) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)) (forall ((v_ArrVal_509 (Array Int Int))) (= |c_ULTIMATE.start_main_~item~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_509) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-11-02 20:45:27,176 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:45:27,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-11-02 20:45:27,184 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:45:27,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-02 20:45:27,197 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:45:27,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 47 [2022-11-02 20:45:27,212 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:45:27,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 53 [2022-11-02 20:45:27,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2022-11-02 20:45:27,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-02 20:45:27,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:45:27,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783330558] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:45:27,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:45:27,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2022-11-02 20:45:27,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009487477] [2022-11-02 20:45:27,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:45:27,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:45:27,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:27,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:45:27,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=152, Unknown=1, NotChecked=24, Total=210 [2022-11-02 20:45:27,353 INFO L87 Difference]: Start difference. First operand 127 states and 139 transitions. Second operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:27,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:27,949 INFO L93 Difference]: Finished difference Result 208 states and 226 transitions. [2022-11-02 20:45:27,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:45:27,950 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-02 20:45:27,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:27,952 INFO L225 Difference]: With dead ends: 208 [2022-11-02 20:45:27,952 INFO L226 Difference]: Without dead ends: 206 [2022-11-02 20:45:27,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=265, Unknown=1, NotChecked=34, Total=380 [2022-11-02 20:45:27,954 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 199 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:27,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 623 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 202 Invalid, 0 Unknown, 135 Unchecked, 0.3s Time] [2022-11-02 20:45:27,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-11-02 20:45:27,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 136. [2022-11-02 20:45:27,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 128 states have (on average 1.1640625) internal successors, (149), 135 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:27,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 149 transitions. [2022-11-02 20:45:27,975 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 149 transitions. Word has length 29 [2022-11-02 20:45:27,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:27,976 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 149 transitions. [2022-11-02 20:45:27,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:45:27,976 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 149 transitions. [2022-11-02 20:45:27,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:45:27,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:27,980 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:28,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:45:28,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-02 20:45:28,193 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-11-02 20:45:28,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:28,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1992708989, now seen corresponding path program 1 times [2022-11-02 20:45:28,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:28,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155645855] [2022-11-02 20:45:28,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:28,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:28,848 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:45:28,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:28,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155645855] [2022-11-02 20:45:28,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155645855] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:45:28,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196883970] [2022-11-02 20:45:28,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:28,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:28,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:28,850 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:28,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:45:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:28,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-02 20:45:29,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:29,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:45:29,070 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:45:29,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:45:29,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-02 20:45:29,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:45:29,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-02 20:45:29,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:45:29,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:45:29,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:45:29,303 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-02 20:45:29,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 42 [2022-11-02 20:45:29,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:45:29,322 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:45:29,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 50 [2022-11-02 20:45:29,344 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-02 20:45:29,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-02 20:45:29,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:45:29,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-11-02 20:45:29,446 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:45:29,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 54 [2022-11-02 20:45:29,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-02 20:45:29,687 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-02 20:45:29,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 26 [2022-11-02 20:45:29,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-02 20:45:29,698 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:45:29,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:45:29,756 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_649 (Array Int Int)) (v_ArrVal_650 (Array Int Int))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_649))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_650) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))) is different from false [2022-11-02 20:45:29,916 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:45:29,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2022-11-02 20:45:29,946 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_649 (Array Int Int)) (v_ArrVal_650 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_12 |c_ULTIMATE.start_main_~item~0#1.offset|))) (or (= .cse0 0) (not (= (select |c_#valid| .cse0) 0)) (not (= 0 (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_12) .cse0 v_ArrVal_649))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_645) .cse0 v_ArrVal_650) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2022-11-02 20:45:29,972 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:45:29,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 65 [2022-11-02 20:45:29,982 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:45:29,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 49 [2022-11-02 20:45:30,056 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:45:30,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 734 treesize of output 649 [2022-11-02 20:45:30,122 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:45:30,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1711 treesize of output 1646 [2022-11-02 20:45:30,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1631 treesize of output 1559 [2022-11-02 20:45:30,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1559 treesize of output 1523 [2022-11-02 20:45:30,345 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:45:30,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1085 treesize of output 1069 [2022-11-02 20:45:30,463 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:45:30,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1499 treesize of output 1343 [2022-11-02 20:46:57,732 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-02 20:46:57,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196883970] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:46:57,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:46:57,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 18 [2022-11-02 20:46:57,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482144314] [2022-11-02 20:46:57,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:46:57,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 20:46:57,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:57,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 20:46:57,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=196, Unknown=3, NotChecked=58, Total=306 [2022-11-02 20:46:57,739 INFO L87 Difference]: Start difference. First operand 136 states and 149 transitions. Second operand has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:58,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:58,209 INFO L93 Difference]: Finished difference Result 158 states and 172 transitions. [2022-11-02 20:46:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:46:58,212 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-02 20:46:58,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:58,213 INFO L225 Difference]: With dead ends: 158 [2022-11-02 20:46:58,213 INFO L226 Difference]: Without dead ends: 156 [2022-11-02 20:46:58,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=308, Unknown=3, NotChecked=74, Total=462 [2022-11-02 20:46:58,214 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 150 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:58,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 672 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 244 Invalid, 0 Unknown, 212 Unchecked, 0.3s Time] [2022-11-02 20:46:58,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-02 20:46:58,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 139. [2022-11-02 20:46:58,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 131 states have (on average 1.1603053435114503) internal successors, (152), 138 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:58,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 152 transitions. [2022-11-02 20:46:58,230 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 152 transitions. Word has length 31 [2022-11-02 20:46:58,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:58,231 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 152 transitions. [2022-11-02 20:46:58,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:58,231 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 152 transitions. [2022-11-02 20:46:58,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:46:58,232 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:58,232 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:58,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:46:58,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 20:46:58,449 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-11-02 20:46:58,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:58,449 INFO L85 PathProgramCache]: Analyzing trace with hash 509365297, now seen corresponding path program 1 times [2022-11-02 20:46:58,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:58,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305447249] [2022-11-02 20:46:58,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:58,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:58,541 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-02 20:46:58,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:58,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305447249] [2022-11-02 20:46:58,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305447249] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:58,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:58,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:46:58,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099105307] [2022-11-02 20:46:58,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:58,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:46:58,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:58,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:46:58,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:46:58,544 INFO L87 Difference]: Start difference. First operand 139 states and 152 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:58,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:58,591 INFO L93 Difference]: Finished difference Result 204 states and 226 transitions. [2022-11-02 20:46:58,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:46:58,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-02 20:46:58,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:58,593 INFO L225 Difference]: With dead ends: 204 [2022-11-02 20:46:58,593 INFO L226 Difference]: Without dead ends: 111 [2022-11-02 20:46:58,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:46:58,596 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 41 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:58,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 122 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:46:58,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-02 20:46:58,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 96. [2022-11-02 20:46:58,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 91 states have (on average 1.120879120879121) internal successors, (102), 95 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:58,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2022-11-02 20:46:58,611 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 36 [2022-11-02 20:46:58,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:58,611 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2022-11-02 20:46:58,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:58,612 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2022-11-02 20:46:58,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:46:58,613 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:58,613 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:46:58,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:46:58,614 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-11-02 20:46:58,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:58,615 INFO L85 PathProgramCache]: Analyzing trace with hash 525270376, now seen corresponding path program 1 times [2022-11-02 20:46:58,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:58,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363376055] [2022-11-02 20:46:58,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:58,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:58,747 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:46:58,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:58,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363376055] [2022-11-02 20:46:58,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363376055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:58,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:58,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:46:58,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694577274] [2022-11-02 20:46:58,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:58,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:46:58,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:58,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:46:58,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:46:58,751 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:58,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:58,800 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2022-11-02 20:46:58,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:46:58,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-02 20:46:58,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:58,803 INFO L225 Difference]: With dead ends: 118 [2022-11-02 20:46:58,803 INFO L226 Difference]: Without dead ends: 107 [2022-11-02 20:46:58,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:46:58,806 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 8 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:58,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 175 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:46:58,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-02 20:46:58,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2022-11-02 20:46:58,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.11) internal successors, (111), 104 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:58,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2022-11-02 20:46:58,819 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 37 [2022-11-02 20:46:58,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:58,821 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2022-11-02 20:46:58,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:46:58,821 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2022-11-02 20:46:58,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:46:58,822 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:58,822 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:46:58,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:46:58,823 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-11-02 20:46:58,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:58,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1226334954, now seen corresponding path program 1 times [2022-11-02 20:46:58,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:58,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953786901] [2022-11-02 20:46:58,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:58,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:59,399 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:46:59,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:59,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953786901] [2022-11-02 20:46:59,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953786901] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:46:59,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212903479] [2022-11-02 20:46:59,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:59,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:59,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:46:59,401 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:46:59,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f5295f-dd6e-4509-b2b1-4052886a91ff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:46:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:59,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-02 20:46:59,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:46:59,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:46:59,591 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:46:59,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:46:59,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:46:59,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:46:59,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-11-02 20:46:59,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:46:59,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:46:59,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:46:59,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:46:59,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-02 20:46:59,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-02 20:46:59,679 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:46:59,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 50 [2022-11-02 20:46:59,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-11-02 20:47:00,125 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-11-02 20:47:00,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 35 [2022-11-02 20:47:00,134 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:47:00,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-11-02 20:47:00,142 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:00,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:47:05,314 INFO L356 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2022-11-02 20:47:05,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 321 treesize of output 296 [2022-11-02 20:47:05,503 INFO L356 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2022-11-02 20:47:05,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 505 treesize of output 426 [2022-11-02 20:47:05,560 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:47:05,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 397 treesize of output 410 [2022-11-02 20:47:05,738 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:47:05,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 946 treesize of output 1048 [2022-11-02 20:47:06,006 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:47:06,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1698 treesize of output 1732 [2022-11-02 20:47:06,157 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:47:06,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 3129 treesize of output 3040 [2022-11-02 20:47:07,442 INFO L356 Elim1Store]: treesize reduction 8, result has 96.4 percent of original size [2022-11-02 20:47:07,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 14171 treesize of output 14205