./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-token-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/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_6499b007-db84-4b70-a0be-3836afd1d2c8/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-token-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/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_6499b007-db84-4b70-a0be-3836afd1d2c8/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 3438cae56d160b7d84eadaf1a799e28d3e56fe8aa8ad4206f8bf5c7c0818717b --- 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:30:28,877 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:30:28,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:30:28,913 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:30:28,914 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:30:28,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:30:28,917 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:30:28,919 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:30:28,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:30:28,922 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:30:28,923 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:30:28,924 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:30:28,925 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:30:28,926 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:30:28,927 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:30:28,929 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:30:28,930 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:30:28,931 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:30:28,933 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:30:28,935 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:30:28,937 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:30:28,939 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:30:28,940 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:30:28,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:30:28,946 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:30:28,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:30:28,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:30:28,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:30:28,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:30:28,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:30:28,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:30:28,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:30:28,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:30:28,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:30:28,955 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:30:28,955 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:30:28,956 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:30:28,956 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:30:28,957 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:30:28,958 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:30:28,959 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:30:28,960 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:30:28,988 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:30:28,988 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:30:28,989 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:30:28,989 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:30:28,990 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:30:28,990 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:30:28,991 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:30:28,991 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:30:28,991 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:30:28,992 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:30:28,992 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:30:28,992 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:30:28,992 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:30:28,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:30:28,993 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:30:28,993 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:30:28,993 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:30:28,994 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:30:28,994 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:30:28,994 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:30:28,994 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:30:28,995 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:30:28,995 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:30:28,995 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:30:28,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:30:28,996 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:30:28,996 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:30:28,996 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:30:28,996 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:30:28,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:30:28,997 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:30:28,997 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:30:28,997 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:30:28,997 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_6499b007-db84-4b70-a0be-3836afd1d2c8/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_6499b007-db84-4b70-a0be-3836afd1d2c8/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 -> 3438cae56d160b7d84eadaf1a799e28d3e56fe8aa8ad4206f8bf5c7c0818717b [2022-11-02 20:30:29,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:30:29,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:30:29,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:30:29,399 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:30:29,400 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:30:29,401 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/forester-heap/sll-token-2.i [2022-11-02 20:30:29,493 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/bin/uautomizer-Dbtcem3rbc/data/ed47388b9/3da389d96aa9415dad0955bda16a25f5/FLAG8dc4f5d92 [2022-11-02 20:30:30,184 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:30:30,185 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/sv-benchmarks/c/forester-heap/sll-token-2.i [2022-11-02 20:30:30,198 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/bin/uautomizer-Dbtcem3rbc/data/ed47388b9/3da389d96aa9415dad0955bda16a25f5/FLAG8dc4f5d92 [2022-11-02 20:30:30,441 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/bin/uautomizer-Dbtcem3rbc/data/ed47388b9/3da389d96aa9415dad0955bda16a25f5 [2022-11-02 20:30:30,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:30:30,446 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:30:30,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:30:30,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:30:30,456 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:30:30,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:30:30" (1/1) ... [2022-11-02 20:30:30,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6553e673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:30, skipping insertion in model container [2022-11-02 20:30:30,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:30:30" (1/1) ... [2022-11-02 20:30:30,467 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:30:30,530 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:30:30,946 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_6499b007-db84-4b70-a0be-3836afd1d2c8/sv-benchmarks/c/forester-heap/sll-token-2.i[22162,22175] [2022-11-02 20:30:30,952 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_6499b007-db84-4b70-a0be-3836afd1d2c8/sv-benchmarks/c/forester-heap/sll-token-2.i[22311,22324] [2022-11-02 20:30:30,953 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_6499b007-db84-4b70-a0be-3836afd1d2c8/sv-benchmarks/c/forester-heap/sll-token-2.i[22402,22415] [2022-11-02 20:30:30,955 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_6499b007-db84-4b70-a0be-3836afd1d2c8/sv-benchmarks/c/forester-heap/sll-token-2.i[22484,22497] [2022-11-02 20:30:30,956 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_6499b007-db84-4b70-a0be-3836afd1d2c8/sv-benchmarks/c/forester-heap/sll-token-2.i[22562,22575] [2022-11-02 20:30:30,958 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_6499b007-db84-4b70-a0be-3836afd1d2c8/sv-benchmarks/c/forester-heap/sll-token-2.i[22708,22721] [2022-11-02 20:30:30,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:30:30,970 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:30:31,003 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_6499b007-db84-4b70-a0be-3836afd1d2c8/sv-benchmarks/c/forester-heap/sll-token-2.i[22162,22175] [2022-11-02 20:30:31,005 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_6499b007-db84-4b70-a0be-3836afd1d2c8/sv-benchmarks/c/forester-heap/sll-token-2.i[22311,22324] [2022-11-02 20:30:31,006 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_6499b007-db84-4b70-a0be-3836afd1d2c8/sv-benchmarks/c/forester-heap/sll-token-2.i[22402,22415] [2022-11-02 20:30:31,007 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_6499b007-db84-4b70-a0be-3836afd1d2c8/sv-benchmarks/c/forester-heap/sll-token-2.i[22484,22497] [2022-11-02 20:30:31,008 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_6499b007-db84-4b70-a0be-3836afd1d2c8/sv-benchmarks/c/forester-heap/sll-token-2.i[22562,22575] [2022-11-02 20:30:31,010 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_6499b007-db84-4b70-a0be-3836afd1d2c8/sv-benchmarks/c/forester-heap/sll-token-2.i[22708,22721] [2022-11-02 20:30:31,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:30:31,038 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:30:31,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:31 WrapperNode [2022-11-02 20:30:31,039 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:30:31,040 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:30:31,040 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:30:31,040 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:30:31,050 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:30:31" (1/1) ... [2022-11-02 20:30:31,064 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:30:31" (1/1) ... [2022-11-02 20:30:31,103 INFO L138 Inliner]: procedures = 119, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 123 [2022-11-02 20:30:31,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:30:31,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:30:31,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:30:31,105 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:30:31,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:31" (1/1) ... [2022-11-02 20:30:31,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:31" (1/1) ... [2022-11-02 20:30:31,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:31" (1/1) ... [2022-11-02 20:30:31,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:31" (1/1) ... [2022-11-02 20:30:31,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:31" (1/1) ... [2022-11-02 20:30:31,161 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:31" (1/1) ... [2022-11-02 20:30:31,165 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:31" (1/1) ... [2022-11-02 20:30:31,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:31" (1/1) ... [2022-11-02 20:30:31,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:30:31,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:30:31,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:30:31,187 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:30:31,188 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:31" (1/1) ... [2022-11-02 20:30:31,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:30:31,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:30:31,227 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:30:31,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:30:31,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:30:31,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:30:31,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:30:31,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:30:31,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:30:31,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:30:31,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:30:31,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:30:31,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:30:31,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:30:31,447 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:30:31,449 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:30:31,744 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:30:31,752 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:30:31,752 INFO L300 CfgBuilder]: Removed 15 assume(true) statements. [2022-11-02 20:30:31,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:30:31 BoogieIcfgContainer [2022-11-02 20:30:31,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:30:31,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:30:31,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:30:31,762 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:30:31,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:30:30" (1/3) ... [2022-11-02 20:30:31,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f366d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:30:31, skipping insertion in model container [2022-11-02 20:30:31,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:31" (2/3) ... [2022-11-02 20:30:31,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f366d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:30:31, skipping insertion in model container [2022-11-02 20:30:31,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:30:31" (3/3) ... [2022-11-02 20:30:31,766 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-token-2.i [2022-11-02 20:30:31,790 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:30:31,790 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-11-02 20:30:31,863 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:30:31,872 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;@228dd5c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:30:31,873 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-02 20:30:31,878 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 43 states have internal predecessors, (67), 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:30:31,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:30:31,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:31,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:30:31,888 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-02 20:30:31,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:31,896 INFO L85 PathProgramCache]: Analyzing trace with hash 890337990, now seen corresponding path program 1 times [2022-11-02 20:30:31,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:31,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985150819] [2022-11-02 20:30:31,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:31,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:32,149 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:30:32,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:32,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985150819] [2022-11-02 20:30:32,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985150819] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:32,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:32,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:30:32,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913210801] [2022-11-02 20:30:32,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:32,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:30:32,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:32,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:30:32,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:30:32,194 INFO L87 Difference]: Start difference. First operand has 44 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 43 states have internal predecessors, (67), 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 3.0) internal successors, (6), 2 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:30:32,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:32,217 INFO L93 Difference]: Finished difference Result 86 states and 132 transitions. [2022-11-02 20:30:32,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:30:32,220 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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:30:32,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:32,230 INFO L225 Difference]: With dead ends: 86 [2022-11-02 20:30:32,230 INFO L226 Difference]: Without dead ends: 39 [2022-11-02 20:30:32,234 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:30:32,238 INFO L413 NwaCegarLoop]: 46 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, 46 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:30:32,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:30:32,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-02 20:30:32,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-02 20:30:32,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 38 states have internal predecessors, (41), 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:30:32,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2022-11-02 20:30:32,281 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 6 [2022-11-02 20:30:32,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:32,281 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2022-11-02 20:30:32,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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:30:32,282 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-11-02 20:30:32,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:30:32,283 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:32,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:30:32,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:30:32,283 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-02 20:30:32,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:32,284 INFO L85 PathProgramCache]: Analyzing trace with hash 889571369, now seen corresponding path program 1 times [2022-11-02 20:30:32,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:32,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46614250] [2022-11-02 20:30:32,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:32,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:32,416 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:30:32,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:32,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46614250] [2022-11-02 20:30:32,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46614250] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:32,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:32,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:30:32,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909142960] [2022-11-02 20:30:32,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:32,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:30:32,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:32,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:30:32,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:30:32,421 INFO L87 Difference]: Start difference. First operand 39 states and 41 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:30:32,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:32,481 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-11-02 20:30:32,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:30:32,482 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:30:32,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:32,484 INFO L225 Difference]: With dead ends: 39 [2022-11-02 20:30:32,484 INFO L226 Difference]: Without dead ends: 37 [2022-11-02 20:30:32,484 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:30:32,486 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:32,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 56 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:30:32,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-02 20:30:32,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-02 20:30:32,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 36 states have internal predecessors, (39), 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:30:32,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-11-02 20:30:32,494 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 6 [2022-11-02 20:30:32,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:32,495 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-11-02 20:30:32,495 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:30:32,496 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-11-02 20:30:32,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 20:30:32,496 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:32,497 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:32,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:30:32,497 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-02 20:30:32,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:32,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1806865149, now seen corresponding path program 1 times [2022-11-02 20:30:32,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:32,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902809029] [2022-11-02 20:30:32,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:32,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:32,658 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:30:32,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:32,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902809029] [2022-11-02 20:30:32,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902809029] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:32,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:32,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:30:32,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224817502] [2022-11-02 20:30:32,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:32,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:30:32,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:32,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:30:32,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:30:32,662 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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:30:32,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:32,733 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2022-11-02 20:30:32,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:30:32,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2022-11-02 20:30:32,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:32,735 INFO L225 Difference]: With dead ends: 63 [2022-11-02 20:30:32,735 INFO L226 Difference]: Without dead ends: 61 [2022-11-02 20:30:32,736 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:30:32,737 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 72 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:32,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 48 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:30:32,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-02 20:30:32,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 35. [2022-11-02 20:30:32,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 34 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:30:32,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2022-11-02 20:30:32,747 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 7 [2022-11-02 20:30:32,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:32,747 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2022-11-02 20:30:32,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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:30:32,748 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-11-02 20:30:32,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:30:32,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:32,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:32,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:30:32,762 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-02 20:30:32,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:32,763 INFO L85 PathProgramCache]: Analyzing trace with hash -913382283, now seen corresponding path program 1 times [2022-11-02 20:30:32,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:32,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391647664] [2022-11-02 20:30:32,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:32,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:32,919 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:30:32,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:32,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391647664] [2022-11-02 20:30:32,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391647664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:32,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:32,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:30:32,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751199756] [2022-11-02 20:30:32,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:32,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:30:32,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:32,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:30:32,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:30:32,923 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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:30:33,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:33,024 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-11-02 20:30:33,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:30:33,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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:30:33,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:33,027 INFO L225 Difference]: With dead ends: 35 [2022-11-02 20:30:33,027 INFO L226 Difference]: Without dead ends: 33 [2022-11-02 20:30:33,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:30:33,029 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:33,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 90 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:30:33,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-02 20:30:33,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-02 20:30:33,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 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:30:33,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-11-02 20:30:33,041 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 12 [2022-11-02 20:30:33,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:33,041 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-11-02 20:30:33,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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:30:33,042 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-11-02 20:30:33,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:30:33,043 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:33,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:33,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:30:33,044 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-02 20:30:33,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:33,044 INFO L85 PathProgramCache]: Analyzing trace with hash -913344547, now seen corresponding path program 1 times [2022-11-02 20:30:33,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:33,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060746168] [2022-11-02 20:30:33,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:33,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:33,821 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:30:33,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:33,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060746168] [2022-11-02 20:30:33,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060746168] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:33,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:33,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:30:33,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872446046] [2022-11-02 20:30:33,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:33,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:30:33,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:33,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:30:33,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:30:33,825 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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:30:34,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:34,151 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-11-02 20:30:34,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:30:34,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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:30:34,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:34,158 INFO L225 Difference]: With dead ends: 50 [2022-11-02 20:30:34,159 INFO L226 Difference]: Without dead ends: 48 [2022-11-02 20:30:34,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:30:34,165 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 36 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:34,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 93 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:30:34,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-02 20:30:34,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2022-11-02 20:30:34,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 41 states have internal predecessors, (46), 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:30:34,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-11-02 20:30:34,183 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 12 [2022-11-02 20:30:34,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:34,183 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-11-02 20:30:34,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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:30:34,185 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-11-02 20:30:34,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:30:34,186 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:34,186 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:34,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:30:34,187 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-02 20:30:34,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:34,188 INFO L85 PathProgramCache]: Analyzing trace with hash -313255267, now seen corresponding path program 1 times [2022-11-02 20:30:34,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:34,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091839869] [2022-11-02 20:30:34,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:34,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:34,802 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:30:34,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:34,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091839869] [2022-11-02 20:30:34,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091839869] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:34,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:34,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:30:34,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097000973] [2022-11-02 20:30:34,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:34,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:30:34,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:34,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:30:34,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:30:34,806 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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:30:35,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:35,030 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2022-11-02 20:30:35,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:30:35,031 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2022-11-02 20:30:35,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:35,037 INFO L225 Difference]: With dead ends: 66 [2022-11-02 20:30:35,037 INFO L226 Difference]: Without dead ends: 64 [2022-11-02 20:30:35,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:30:35,046 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 28 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:35,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 135 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:30:35,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-02 20:30:35,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2022-11-02 20:30:35,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 47 states have internal predecessors, (52), 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:30:35,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-11-02 20:30:35,068 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 16 [2022-11-02 20:30:35,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:35,069 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-11-02 20:30:35,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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:30:35,069 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-11-02 20:30:35,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:30:35,071 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:35,071 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:35,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:30:35,072 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-02 20:30:35,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:35,073 INFO L85 PathProgramCache]: Analyzing trace with hash -648614522, now seen corresponding path program 1 times [2022-11-02 20:30:35,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:35,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456192873] [2022-11-02 20:30:35,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:35,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:35,542 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:30:35,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:35,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456192873] [2022-11-02 20:30:35,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456192873] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:30:35,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489635954] [2022-11-02 20:30:35,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:35,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:30:35,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:30:35,553 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:30:35,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:30:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:35,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-02 20:30:35,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:30:35,769 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:30:35,780 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:30:35,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:35,853 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 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-02 20:30:35,871 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:30:35,871 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 16 treesize of output 22 [2022-11-02 20:30:35,886 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 7 treesize of output 3 [2022-11-02 20:30:35,912 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:30:35,913 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:30:36,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:36,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:36,050 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 19 treesize of output 23 [2022-11-02 20:30:36,072 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-02 20:30:36,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:30:36,129 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:30:36,132 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:30:36,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:30:36,357 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:30:36,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489635954] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-02 20:30:36,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:30:36,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 11 [2022-11-02 20:30:36,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532370824] [2022-11-02 20:30:36,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:36,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:30:36,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:36,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:30:36,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:30:36,360 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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:30:36,371 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (= (select .cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) 0) (forall ((v_ArrVal_319 (Array Int Int)) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_317 Int) (|v_ULTIMATE.start_main_~x~0#1.base_28| Int) (|v_ULTIMATE.start_main_#t~malloc5#1.base_12| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_28|) 0)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_28| 1) |v_ULTIMATE.start_main_#t~malloc5#1.base_12|) 0)) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_317)) |v_ULTIMATE.start_main_~x~0#1.base_28| v_ArrVal_320) |v_ULTIMATE.start_main_#t~malloc5#1.base_12| v_ArrVal_319) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) 0))))) is different from false [2022-11-02 20:30:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:36,449 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-11-02 20:30:36,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:30:36,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2022-11-02 20:30:36,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:36,451 INFO L225 Difference]: With dead ends: 60 [2022-11-02 20:30:36,451 INFO L226 Difference]: Without dead ends: 58 [2022-11-02 20:30:36,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=98, Unknown=1, NotChecked=20, Total=156 [2022-11-02 20:30:36,453 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:36,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 139 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 43 Unchecked, 0.1s Time] [2022-11-02 20:30:36,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-02 20:30:36,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2022-11-02 20:30:36,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 49 states have internal predecessors, (55), 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:30:36,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-11-02 20:30:36,465 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 16 [2022-11-02 20:30:36,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:36,466 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-11-02 20:30:36,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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:30:36,466 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-11-02 20:30:36,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:30:36,467 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:36,468 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:36,518 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:30:36,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:30:36,678 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-02 20:30:36,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:36,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1909855756, now seen corresponding path program 1 times [2022-11-02 20:30:36,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:36,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183783555] [2022-11-02 20:30:36,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:36,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:36,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:36,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:36,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183783555] [2022-11-02 20:30:36,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183783555] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:36,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:36,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:30:36,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255360519] [2022-11-02 20:30:36,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:36,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:30:36,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:36,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:30:36,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:30:36,970 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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:30:37,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:37,123 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-11-02 20:30:37,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:30:37,124 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 18 [2022-11-02 20:30:37,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:37,124 INFO L225 Difference]: With dead ends: 76 [2022-11-02 20:30:37,124 INFO L226 Difference]: Without dead ends: 50 [2022-11-02 20:30:37,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:30:37,126 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:37,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 135 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:30:37,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-02 20:30:37,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-02 20:30:37,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.148936170212766) internal successors, (54), 49 states have internal predecessors, (54), 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:30:37,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-11-02 20:30:37,138 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 18 [2022-11-02 20:30:37,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:37,138 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-11-02 20:30:37,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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:30:37,139 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-11-02 20:30:37,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 20:30:37,140 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:37,140 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:30:37,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:30:37,140 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-02 20:30:37,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:37,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1000772550, now seen corresponding path program 1 times [2022-11-02 20:30:37,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:37,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448175439] [2022-11-02 20:30:37,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:37,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:37,518 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:30:37,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:37,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448175439] [2022-11-02 20:30:37,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448175439] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:30:37,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652816139] [2022-11-02 20:30:37,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:37,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:30:37,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:30:37,523 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:30:37,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:30:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:37,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-02 20:30:37,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:30:37,691 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:30:37,699 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:30:37,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:37,765 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 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-02 20:30:37,784 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:30:37,784 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 16 treesize of output 22 [2022-11-02 20:30:37,793 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 7 treesize of output 3 [2022-11-02 20:30:37,829 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:30:37,830 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:30:37,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:37,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:37,983 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 19 treesize of output 23 [2022-11-02 20:30:38,010 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-02 20:30:38,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:30:38,058 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:30:38,073 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:30:38,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:30:38,294 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:30:38,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652816139] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-02 20:30:38,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:30:38,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2022-11-02 20:30:38,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927739661] [2022-11-02 20:30:38,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:38,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:30:38,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:38,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:30:38,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:30:38,298 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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:30:38,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:38,399 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-11-02 20:30:38,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:30:38,399 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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:30:38,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:38,400 INFO L225 Difference]: With dead ends: 68 [2022-11-02 20:30:38,400 INFO L226 Difference]: Without dead ends: 52 [2022-11-02 20:30:38,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:30:38,404 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:38,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 114 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 36 Unchecked, 0.0s Time] [2022-11-02 20:30:38,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-02 20:30:38,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-11-02 20:30:38,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.127659574468085) internal successors, (53), 49 states have internal predecessors, (53), 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:30:38,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-11-02 20:30:38,418 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 20 [2022-11-02 20:30:38,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:38,419 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-11-02 20:30:38,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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:30:38,419 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-11-02 20:30:38,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:30:38,420 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:38,420 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:38,462 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:30:38,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:30:38,642 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-02 20:30:38,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:38,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1552465966, now seen corresponding path program 1 times [2022-11-02 20:30:38,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:38,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695104416] [2022-11-02 20:30:38,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:38,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:38,716 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:30:38,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:38,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695104416] [2022-11-02 20:30:38,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695104416] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:38,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:38,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:30:38,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179530076] [2022-11-02 20:30:38,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:38,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:30:38,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:38,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:30:38,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:30:38,722 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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:30:38,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:38,788 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2022-11-02 20:30:38,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:30:38,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2022-11-02 20:30:38,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:38,789 INFO L225 Difference]: With dead ends: 50 [2022-11-02 20:30:38,789 INFO L226 Difference]: Without dead ends: 31 [2022-11-02 20:30:38,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:30:38,793 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:38,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 91 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:30:38,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-02 20:30:38,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-11-02 20:30:38,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 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:30:38,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-11-02 20:30:38,806 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 22 [2022-11-02 20:30:38,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:38,807 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-11-02 20:30:38,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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:30:38,807 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-11-02 20:30:38,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:30:38,808 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:38,808 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:38,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:30:38,809 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-02 20:30:38,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:38,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1970202869, now seen corresponding path program 1 times [2022-11-02 20:30:38,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:38,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229799332] [2022-11-02 20:30:38,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:38,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:39,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:39,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:39,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229799332] [2022-11-02 20:30:39,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229799332] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:30:39,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876231657] [2022-11-02 20:30:39,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:39,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:30:39,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:30:39,835 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:30:39,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:30:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:39,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-02 20:30:39,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:30:40,009 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:30:40,043 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:30:40,061 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:30:40,062 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:30:40,071 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:30:40,099 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:30:40,099 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:30:40,127 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:30:40,133 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:30:40,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:40,326 INFO L356 Elim1Store]: treesize reduction 31, result has 31.1 percent of original size [2022-11-02 20:30:40,326 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 72 treesize of output 69 [2022-11-02 20:30:40,341 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 25 treesize of output 29 [2022-11-02 20:30:40,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:40,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:40,354 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 21 treesize of output 25 [2022-11-02 20:30:40,364 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 12 treesize of output 11 [2022-11-02 20:30:40,390 INFO L356 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-02 20:30:40,391 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 1 case distinctions, treesize of input 26 treesize of output 44 [2022-11-02 20:30:40,423 INFO L356 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2022-11-02 20:30:40,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2022-11-02 20:30:40,641 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:30:40,647 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:30:40,653 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:30:40,654 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 26 [2022-11-02 20:30:40,675 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:30:40,689 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:40,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:30:40,761 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:30:40,762 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2022-11-02 20:30:40,776 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:30:40,776 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 2 case distinctions, treesize of input 51 treesize of output 57 [2022-11-02 20:30:40,794 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:30:40,795 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 100 treesize of output 99 [2022-11-02 20:30:40,805 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 21 [2022-11-02 20:30:40,865 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 24 treesize of output 20 [2022-11-02 20:30:40,881 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_630 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_6) .cse0 v_ArrVal_630) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse0))) (not (= (select |c_#valid| .cse0) 0))))) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_630 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_6) .cse1 v_ArrVal_630) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (not (= (select |c_#valid| .cse1) 0))))) (forall ((v_ArrVal_624 (Array Int Int)) (v_ArrVal_627 (Array Int Int)) (v_arrayElimCell_39 Int)) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_624) v_arrayElimCell_39 v_ArrVal_627) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.offset|) (not (= (select |c_#valid| v_arrayElimCell_39) 0))))) is different from false [2022-11-02 20:30:41,046 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:30:41,046 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 105 treesize of output 98 [2022-11-02 20:30:41,059 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:30:41,059 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 117 treesize of output 118 [2022-11-02 20:30:41,075 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:30:41,076 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 238 treesize of output 189 [2022-11-02 20:30:41,097 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:30:41,097 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 280 treesize of output 279 [2022-11-02 20:30:41,112 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 263 treesize of output 259 [2022-11-02 20:30:41,123 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 259 treesize of output 251 [2022-11-02 20:30:41,134 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 251 treesize of output 247 [2022-11-02 20:30:41,153 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:30:41,154 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 247 treesize of output 244 [2022-11-02 20:30:41,167 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 235 treesize of output 231 [2022-11-02 20:30:41,189 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:30:41,190 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 231 treesize of output 220 [2022-11-02 20:30:43,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 20:30:43,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876231657] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:30:43,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:30:43,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2022-11-02 20:30:43,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058016070] [2022-11-02 20:30:43,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:30:43,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:30:43,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:43,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:30:43,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=146, Unknown=1, NotChecked=24, Total=210 [2022-11-02 20:30:43,461 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 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:30:43,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:43,679 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-11-02 20:30:43,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:30:43,680 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 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 22 [2022-11-02 20:30:43,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:43,681 INFO L225 Difference]: With dead ends: 66 [2022-11-02 20:30:43,681 INFO L226 Difference]: Without dead ends: 50 [2022-11-02 20:30:43,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=167, Unknown=1, NotChecked=26, Total=240 [2022-11-02 20:30:43,682 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:43,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 154 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 128 Invalid, 0 Unknown, 44 Unchecked, 0.2s Time] [2022-11-02 20:30:43,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-02 20:30:43,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2022-11-02 20:30:43,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 45 states have internal predecessors, (48), 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:30:43,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2022-11-02 20:30:43,693 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 22 [2022-11-02 20:30:43,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:43,693 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2022-11-02 20:30:43,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 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:30:43,694 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2022-11-02 20:30:43,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:30:43,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:43,695 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:43,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:30:43,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-02 20:30:43,922 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-02 20:30:43,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:43,922 INFO L85 PathProgramCache]: Analyzing trace with hash -882557003, now seen corresponding path program 1 times [2022-11-02 20:30:43,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:43,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255097488] [2022-11-02 20:30:43,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:43,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:44,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:44,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:44,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255097488] [2022-11-02 20:30:44,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255097488] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:30:44,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035233938] [2022-11-02 20:30:44,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:44,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:30:44,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:30:44,778 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:30:44,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6499b007-db84-4b70-a0be-3836afd1d2c8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:30:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:44,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-02 20:30:44,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:30:44,966 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:30:44,987 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:30:45,001 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:30:45,002 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:30:45,009 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:30:45,021 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:30:45,039 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:30:45,039 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:30:45,048 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:30:45,072 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:30:45,072 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:30:45,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:45,250 INFO L356 Elim1Store]: treesize reduction 31, result has 31.1 percent of original size [2022-11-02 20:30:45,251 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 50 treesize of output 51 [2022-11-02 20:30:45,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:45,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:30:45,263 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 24 treesize of output 28 [2022-11-02 20:30:45,266 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 12 treesize of output 11 [2022-11-02 20:30:45,283 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 12 treesize of output 11 [2022-11-02 20:30:45,305 INFO L356 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2022-11-02 20:30:45,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2022-11-02 20:30:45,317 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-02 20:30:45,728 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-02 20:30:45,729 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 85 treesize of output 47 [2022-11-02 20:30:45,751 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:30:45,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 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:30:45,778 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:30:45,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:45,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:30:45,906 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:30:45,907 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 93 [2022-11-02 20:30:45,916 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:30:45,916 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 100 [2022-11-02 20:30:45,922 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 247 treesize of output 169 [2022-11-02 20:30:45,983 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_12 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_12 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (select |c_#valid| .cse0) 0)) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_760 (Array Int Int))) (= (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_13) .cse0 v_ArrVal_760))) (select (select .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_12) .cse0 v_ArrVal_755) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0)) (not (= (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~x~0#1.offset|) 0))))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_12 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (select |c_#valid| .cse2) 0)) (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_760 (Array Int Int))) (= (select (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_12) .cse2 v_ArrVal_755))) (select .cse3 (select (select .cse3 |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_~x~0#1.base| v_arrayElimArr_13) .cse2 v_ArrVal_760) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) .cse2)))))))) is different from false [2022-11-02 20:30:46,182 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:30:46,183 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 165 treesize of output 150 [2022-11-02 20:30:46,194 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:30:46,195 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 141 treesize of output 126 [2022-11-02 20:30:46,304 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:30:46,305 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 1870 treesize of output 1435 [2022-11-02 20:30:47,450 INFO L356 Elim1Store]: treesize reduction 294, result has 60.5 percent of original size [2022-11-02 20:30:47,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 7848 treesize of output 7589 [2022-11-02 20:30:48,084 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:30:48,085 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 6 new quantified variables, introduced 10 case distinctions, treesize of input 6520 treesize of output 6334 [2022-11-02 20:30:48,727 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:30:48,729 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 6300 treesize of output 5984 [2022-11-02 20:30:49,333 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 5922 treesize of output 5450 [2022-11-02 20:30:49,670 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:30:49,671 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 5468 treesize of output 4946 [2022-11-02 20:30:49,926 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 5588 treesize of output 5492 [2022-11-02 20:30:50,296 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:30:50,297 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 5038 treesize of output 4948 [2022-11-02 20:30:50,695 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:30:50,696 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 5372 treesize of output 4950 [2022-11-02 20:30:51,035 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:30:51,036 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 4916 treesize of output 4884